computational complexity

Science Dictionary
computational complexity   (kŏm'py-tā'shə-nəl)  Pronunciation Key 
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.
The American Heritage® Science Dictionary
Copyright © 2002. Published by Houghton Mifflin. All rights reserved.
Cite This Source
Computing Dictionary

computational complexity definition

The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature