Complexity class
Complexity class 24 languages Article Talk Read Edit View history From Wikipedia, the free encyclopedia A representation of the relationships between several important complexity classes In computational complexity theory , a complexity class is a set of computational problems of related resource-based complexity . The two most commonly analyzed resources are time and memory . In general, a complexity class is defined in terms of a type of computational problem, a model of computation , and a bounded resource like time or memory . In particular, most complexity classes consist of decision problems that are solvable with a Turing machine , and are differentiated by their time or space (memory) requirements. For instance, the class P is the set of decision problems solvable by a deterministic Turing machine in polynomial time . There are, however, many compl...