Definition of PSPACE. Meaning of PSPACE. Synonyms of PSPACE

- complements of all problems in PSPACE are also in PSPACE, meaning that co-PSPACE = PSPACE. The following relations are known between PSPACE and the complexity classes...
- In com****tional complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input...
- problems solvable by an interactive proof system. It is equal to the class PSPACE. The result was established in a series of papers: the first by Lund, Karloff...
- Second-order logic with a transitive closure (commutative or not) yields PSPACE, the problems solvable in polynomial space. Second-order logic with a least...
- hypothetical technologies List of NP-complete problems List of paradoxes List of PSPACE-complete problems List of undecidable problems List of unsolved deaths Lists...
- basic time and space complexity classes in the following way: P ⊆ NP ⊆ PSPACE ⊆ EXPTIME ⊆ NEXPTIME ⊆ EXPSPACE. Furthermore, by the time hierarchy theorem...
- complexity classes relate to each other in the following way: L⊆NL⊆P⊆NP⊆PSPACE⊆EXPTIME⊆NEXPTIME⊆EXPSPACE (where ⊆ denotes the subset relation). However...
- is contained in PSPACE, which also proves that QIP = IP = PSPACE, since PSPACE is easily shown to be in QIP using the result IP = PSPACE. Watrous, John...
- need not store game states; however many games of interest are known to be PSPACE-hard, and it follows that their space complexity will be lower-bounded by...
- exponential time, a very large class. NEXPTIME contains PSPACE, and is believed to strictly contain PSPACE. Adding a constant number of additional provers beyond...