In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly...

of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics...

computer science) In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems....

In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can...

more decrease time complexity (Greenlaw and Hoover 1998: 226), while inductive Turing machines can decrease even the complexity class of a function, language...

In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according...

In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in...

In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t...

the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly...

computer science) In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems that...

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource...

In computational complexity theory, L (also known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved...

Boaz (Spring 2006). "Complexity of counting" (PDF). Princeton University. "counting problem". PlanetMath. "counting complexity class". PlanetMath. v t e...

(Randomized Logarithmic-space Polynomial-time), is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial...

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus...

In computational complexity theory, the complexity class ESPACE is the set of decision problems that can be solved by a deterministic Turing machine in...

In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time...

unsolved problems in computer science) In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic...

In computational complexity theory, the complexity class FP is the set of function problems that can be solved by a deterministic Turing machine in polynomial...

Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic...

Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational...

several important complexity classes is allowing for an error probability of 1/3. For instance, the complexity class BPP is defined as the class of languages...

functions is a popular approach to separating complexity classes. For example, a prominent circuit class P/poly consists of Boolean functions computable...

In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or...

the input, but not on the input itself. A decision problem is in the complexity class P/f(n) if there is a polynomial time Turing machine M with the following...

Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)...

In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin...

there may be restrictions on some other complexity resources (like alternation). Many important complexity classes are defined in terms of DTIME, containing...

In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability...

algorithm k times and returning the majority function of the answers. The complexity class BPP describes decision problems that can be solved by polynomial-time...