Category:Complexity classes

• Complexity class

*

• List of complexity classes
• List of computability and complexity topics

♯

• ♯P

2

• 2-EXPTIME

A

• AC (complexity)
• AC0
• ACC0
• ALL (complexity)
• APX
• Arithmetical hierarchy

C

• Catalytic computing
• CC (complexity)
• Co-NP
• Co-NP-complete
• Co-RE
• Co-RE-complete
• Counting hierarchy

D

• DLIN
• DLOGTIME
• DSPACE
• DTIME

E

• E (complexity)
• ELEMENTARY
• Elementary recursive function
• ESPACE
• Exponential hierarchy
• EXPSPACE
• EXPTIME

F

• FIXP
• FL (complexity)
• FNP (complexity)
• FP (complexity)
• FPT (complexity class)
• Fully polynomial-time approximation scheme

G

• GapP
• GI (complexity)
• GI-complete

L

• L (complexity)
• L/poly
• LH (complexity)
• LOGCFL

N

• NC (complexity)
• NE (complexity)
• NEXPTIME
• NL (complexity)
• NL-complete
• NLIN
• Nonelementary problem
• NP (complexity)
• NP-completeness
• NP-easy
• NP-equivalent
• NP-hardness
• NP-intermediate
• NP/poly
• NSPACE
• NTIME

P

• P (complexity)
• P/poly
• P-complete
• Parity P
• PLS (complexity)
• PolyL
• Polynomial hierarchy
• Polynomial-time approximation scheme
• PPA (complexity)
• PPAD (complexity)
• PPP (complexity)
• PR (complexity)
• Pseudo-polynomial time
• Pseudo-polynomial transformation
• PSPACE
• PSPACE-complete
• PSPACE-hard

Q

• Quasi-polynomial time

R

• R (complexity)
• Random-access Turing machine
• RE (complexity)
• RE-complete
• Ring star problem

S

• S2P (complexity)
• SC (complexity)
• ♯P-complete
• SL (complexity)
• SNP (complexity)
• Strong NP-completeness
• Strongly-polynomial time
• SUBEXP

T

• TC (complexity)
• TC0
• TFNP

U

• UP (complexity)

W

• W hierarchy
• Weak NP-completeness

X

• XP (complexity class)