Asymptotic computational complexity - Wikipedia
In computational complexity theory, asymptotic computational complexity is the use of asymptotic analysis for the estimation of the computational complexity
Quantum complexity theory - Wikipedia
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational
Complexity theory - Wikipedia
Complexity theory may refer to: Computational complexity theory, a field in theoretical computer science and mathematics Complex systems theory, the study
Computational complexity theory - Wikipedia
theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage
Geometric complexity theory - Wikipedia
Geometric complexity theory (GCT), is a research program in computational complexity theory proposed by Ketan Mulmuley and Milind Sohoni. The goal of
Scott Aaronson - Wikipedia
particularly computational complexity theory. At Cornell, he became interested in quantum computing and devoted himself to computational complexity and quantum
Advice (complexity) - Wikipedia
In computational complexity theory, an advice string is an extra input to a Turing machine that is allowed to depend on the length n of the input, but
NL-complete - Wikipedia
In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems
P-complete - Wikipedia
In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be
NP-hardness - Wikipedia
computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time
Exponential time hypothesis - Wikipedia
computational complexity theory, the exponential time hypothesis or ETH is an unproven computational hardness assumption that was formulated by Impagliazzo &
Model of computation - Wikipedia
more specifically in computability theory and computational complexity theory, a model of computation is a model that describes how an output of a mathematical
Proof - Wikipedia
Proof complexity, computational resources required to prove statements Proof procedure, method for producing proofs in proof theory Proof theory, a branch of mathematical logic that represents proofs …
PSPACE-complete - Wikipedia
In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input
Computational complexity theory - Wikipedia