Audio (US) (file)
- (computer science) The study and classification of decision problems by the computational resources—such as time and space—needed by the programs that solve the problems.
- The professor of complexity theory says that the problem can be solved in polynomial time.
the study and classification of decision problems by the computational resources
- Parker, R. Gary and Ronald L. Rardin, "An Overview of Complexity Theory in Discrete Optimization: Part 1. Concepts", IIE Transactions, March 1982, page 4.