computational complexity

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

computational complexity

n.
The quantification of the difficulty of a computational problem in terms of the computer resources (such as computational time or amount of memory) required for its solution.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
Mentioned in
References in periodicals archive
Soon many others joined the exploration of the complexity of computation, and computational complexity theory grew into a major research area with deep and interesting results and some of the most notorious open problems in computer science.
Turing Award lecture: on computational complexity and the nature of computer science
infinite functions and the ultimate behavior of run times on large arguments yield useful insights into computational complexity theory.
Abstract complexity theory and the mind-machine problem
Copyright © 2003-2025 Farlex, Inc Disclaimer
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.