computational complexity

[ kŏm′pyu-tāshə-nəl ]

A mathematical characterization of the difficulty of a mathematical problem which describes the resources required by a computing machine to solve the problem. The mathematical study of such characterizations is called computational complexity theory and is important in many branches of theoretical computer science, especially cryptography.

QUIZZES

CAN YOU GUESS THESE WORDS FROM AROUND THE US?

American English is not always as it appears to be ... get to know regional words in this quiz!
Question 1 of 10
A bet is synonymous with a wager, but what does it mean in New York?
The American Heritage® Science Dictionary Copyright © 2011. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.