complexity class
set of problems in computational complexity theory of related resource-based complexity
pseudo-polynomial time
Term in Complexity Theory
complete
notion of the "hardest" or "most general" problem in a complexity class
ALL
class of all decision problems
PR
complexity class of primitive recursive functions
P-complete
class in computational complexity theory
R
set of all total computable functions
NE
class in computational complexity theory
AC
complexity class
polynomial-time approximation scheme
complexity class
RE
complexity class
E
complexity class
PP
complexity class
ELEMENTARY
complexity class, algebra
P/poly
complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function
P
computational complexity class of problems
PH
algorithmic complexity class; the union of all complexity classes in the polynomial hierarchy; the set of languages expressible by second-order logic
CC
complexity class in computational complexity theory
GapP
counting complexity class
HO
complexity class of structures that can be recognized by formulas of higher-order logic
FO
complexity class of structures that can be recognized by formulas of first-order logic
IP
complexity class
L/poly
complexity class of logarithmic space machines with a polynomial amount of advice
SC
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space
UP
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
NC
complexity class
L
complexity class (logarithmic space)