Template:Complexity classes
kidzsearch.com
>
wiki
>
Complexity classes
Jump to navigation
Jump to search
v
t
e
Complexity classes
Considered feasible
DLOGTIME
AC
0
ACC
0
TC
0
L
SL
RL
FL
NL
NL-complete
NC
SC
CC
P
P-complete
ZPP
RP
BPP
BQP
APX
FP
Suspected infeasible
NP
NP-hard
NP-complete
co-NP
co-NP-complete
UP
TFNP
FNP
AM
QMA
PH
⊕P
PP
#P
#P-complete
IP
PSPACE
PSPACE-complete
Considered infeasible
EXPTIME
NEXPTIME
EXPSPACE
2-EXPTIME
ELEMENTARY
PR
R
RE
ALL
Class hierarchies
Polynomial hierarchy
Exponential hierarchy
Grzegorczyk hierarchy
Arithmetical hierarchy
Boolean hierarchy
Families of classes
DTIME
NTIME
DSPACE
NSPACE
Probabilistically checkable proof
Interactive proof system
Template documentation
[
create
]
Editors can experiment in this template's sandbox
(
create
|
mirror
)
and testcases
(
create
)
pages.
Please add categories to the
/doc
subpage.
Subpages of this template
.
Category
:
Computer science navigational boxes
Navigation menu
Personal tools
Log in
Namespaces
Template
Talk
Variants
Views
Read
View source
View history
More
Search
KidzSearch
Main
Art
English
Geography
Health
History
Math
Music
Science
Social Science
Technology
Help
Report Page
Tools
What links here
Related changes
Special pages
Page for printing
Permanent link
Page information