Encyclopedia

computational complexity

Also found in: Dictionary, Acronyms, Wikipedia.

(redirected from Computational complexity theory)

computational complexity

(algorithm)

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

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Mentioned in

complexity
exponential-time algorithm
metaheuristic
NP-complete
NP-hard
polynomial-time algorithm
space complexity
time complexity

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.