computational complexity

(redirected from Computational complexity theory)
Also found in: Dictionary, Acronyms, Wikipedia.

computational complexity

(algorithm)
The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity.
References in periodicals archive ?
Blum is one of the founders of computational complexity theory, a field that is central to theoretical computer science, and one which deals with measuring the difficulty of performing computations.
The PCP theorem, proven in the early 90 s, is a cornerstone of modern computational complexity theory.

Full browser ?