Reduction (complexity)
article-link
What links here
PSPACE
Alternating Turing machine
article-link
List of complexity classes
article-link
Space hierarchy theorem
article-link
Arthur–Merlin protocol
article-link
Cook–Levin theorem
article-link
PP (complexity)
article-link
Polynomial hierarchy
article-link
DSPACE
article-link
P (complexity)
article-link
Savitch's theorem
article-link
NSPACE
article-link
Nondeterministic finite automaton
article-link
Complexity class
article-link
Randomized algorithm
article-link
Random oracle
article-link
Zero-knowledge proof
article-link
Referential integrity
article-link
Many-one reduction
article-link
Second-order logic
article-link
Space complexity
article-link
Game complexity
article-link
Shannon switching game
article-link
Transitive closure
article-link
Closed timelike curve
article-link
Probabilistic Turing machine
article-link
Time hierarchy theorem
article-link
Hypercomputation
article-link
Interactive proof system
article-link
Polynomial-time reduction
article-link
Ultrafinitism
article-link
Adi Shamir
article-link
EXPTIME
article-link
PSPACE-complete
article-link
NP-hardness
article-link
RP (complexity)
article-link
EXPSPACE
article-link
ZPP (complexity)
article-link
Novikov self-consistency principle
article-link
Travelling salesman problem
article-link
Ray tracing (graphics)
article-link
Phutball
article-link
Oracle machine
article-link
NP (complexity)
article-link
Computational complexity theory
article-link
Co-NP
article-link
P versus NP problem
article-link
BQP
article-link
BPP (complexity)
article-link
NPSPACE
redirect