![]() | |
External pages | Complexity Zoo |
---|---|
Complete class | PSPACE-complete |
Complement class | self |
Equalities | AP [1], BPPSPACE [2], IP [3], NPSPACE [4], PPSPACE [5], SAPTIME [5] |
DTIME | , |
Related | PTIME |
Proper supersets | EXPSPACE [6] |
Improper supersets | AlmostPSPACE [7], EXPTIME, RG, QPSPACE [8] |
Inequalities | P-close, P/log |
Improper subsets | CH [9], P^ PP [10], P^ #P [10], QSZK, RG[1] |
Proper subsets | NL [6] |
Canonical problems | QSAT |
Properties | Syntactic |
Low with | self |
Low for | self |
Closed reductions | Poly-time |
Models | Alternating Turing machine, Turing machine |
User:C. lorenz/Template:Infobox Complexity Class
![]() | |
External pages | Complexity Zoo |
---|---|
Complete class | PSPACE-complete |
Complement class | self |
Equalities | AP [1], BPPSPACE [2], IP [3], NPSPACE [4], PPSPACE [5], SAPTIME [5] |
DTIME | , |
Related | PTIME |
Proper supersets | EXPSPACE [6] |
Improper supersets | AlmostPSPACE [7], EXPTIME, RG, QPSPACE [8] |
Inequalities | P-close, P/log |
Improper subsets | CH [9], P^ PP [10], P^ #P [10], QSZK, RG[1] |
Proper subsets | NL [6] |
Canonical problems | QSAT |
Properties | Syntactic |
Low with | self |
Low for | self |
Closed reductions | Poly-time |
Models | Alternating Turing machine, Turing machine |
User:C. lorenz/Template:Infobox Complexity Class