Help
Category
:
Complexity classes
From Wikipedia, the free encyclopedia
Revision as of 21:03, 27 February 2018 by
imported>Dpleibovitz
(More specific
Category:Classification systems by subject
)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation
Jump to search
Template:Cat main
Template:Anchor
Pages in category "Complexity classes"
The following 39 pages are in this category, out of 39 total.
Complexity class
*
List of complexity classes
List of computability and complexity topics
A
Arithmetical hierarchy
C
Co-NP
Co-NP-complete
D
DSPACE
DTIME
E
E (complexity)
Elementary recursive function
ESPACE
Exponential hierarchy
EXPSPACE
EXPTIME
F
FL (complexity)
FNP (complexity)
FP (complexity)
L
L (complexity)
N
NC (complexity)
NE (complexity)
NEXPTIME
NL (complexity)
NP (complexity)
NP-easy
NP-equivalent
NP-hardness
NSPACE
NTIME
P
P (complexity)
P-complete
Polynomial hierarchy
Polynomial-time approximation scheme
PSPACE
PSPACE-complete
PSPACE-hard
S
♯P-complete
SL (complexity)
U
UP (complexity)
♯
♯P
Categories
:
Structural complexity theory
Computational complexity theory
Classification systems by subject
Navigation menu
Personal tools
Create account
Log in
Namespaces
Category
Discussion
English
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random article
Help about MediaWiki
Special pages
Tools
What links here
Related changes
Printable version
Permanent link
Page information