problems in PSPACE are also in PSPACE, meaning that co-PSPACE = PSPACE.[citation needed] The following relations are known between PSPACE and the complexity...

In computational 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...

hypothetical technologies List of NP-complete problems List of paradoxes List of PSPACE-complete problems List of undecidable problems List of unsolved deaths Lists...

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...

basic time and space complexity classes in the following way: P ⊆ NP ⊆ PSPACE ⊆ EXPTIME ⊆ NEXPTIME ⊆ EXPSPACE. Furthermore, by the time hierarchy theorem...

Second-order logic with a transitive closure (commutative or not) yields PSPACE, the problems solvable in polynomial space. Second-order logic with a least...

complexity classes relate to each other in the following way: L⊆NL⊆P⊆NP⊆PSPACE⊆EXPTIME⊆NEXPTIME⊆EXPSPACE (where ⊆ denotes the subset relation). However...

also known to be no larger than PSPACE, the class of problems decidable in polynomial space. Again, whether P = PSPACE is an open problem. To summarize:...

complexity. Without ko, Go is PSPACE-hard. This is proved by reducing True Quantified Boolean Formula, which is known to be PSPACE-complete, to generalized...

use O ( f ( n ) ) {\displaystyle O(f(n))} space. The complexity classes PSPACE and NPSPACE allow f {\displaystyle f} to be any polynomial, analogously...

interactive proofs, and the quantum analogue of the celebrated result IP = PSPACE: QIP = PSPACE. This was preceded by a series of results, showing QIP can be constrained...

1145/321978.321989. S2CID 8845949. Stefan Reisch (1981). "Hex ist PSPACE-vollständig (Hex is PSPACE-complete)". Acta Informatica. 15 (2): 167–191. doi:10.1007/bf00288964...

Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive. Generalized...

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...

the classes NP and co-NP. Each class in the hierarchy is contained within PSPACE. The hierarchy can be defined using oracle machines or alternating Turing...

ignoring the proof and solving it. NP is contained in PSPACE—to show this, it suffices to construct a PSPACE machine that loops over all proof strings and feeds...

is in EXPSPACE, and is PSPACE-hard. It's proved to be PSPACE-hard by reducing Generalized Geography, a problem known to be PSPACE-hard, to a game of Ghost...

Italy, vehicle registration code AP, an alternative characterization of PSPACE In computational complexity theory Application Processor, usually means...

prove that IP = PSPACE. However, in 2008, Scott Aaronson and Avi Wigderson showed that the main technical tool used in the IP = PSPACE proof, known as...

exponential time, a very large class. NEXPTIME contains PSPACE, and is believed to strictly contain PSPACE. Adding a constant number of additional provers beyond...

Arthur can interact for k rounds. QMA is QIP(1). QIP(2) is known to be in PSPACE. QIP is QIP(k) where k is allowed to be polynomial in the number of qubits...

P, NP, and PSPACE is not known. However, it is known that P ⊆ B Q P ⊆ P S P A C E {\displaystyle {\mathsf {P\subseteq BQP\subseteq PSPACE}}} ; that is...

polynomial space, but not in non-deterministic polynomial time (unless NP = PSPACE). NP-hard problems do not have to be elements of the complexity class NP...

}{=}}{\mathsf {PSPACE}}} ⁠ (more unsolved problems in computer science) PH contains almost all well-known complexity classes inside PSPACE; in particular...

\exists z\ ((x\lor z)\land y)} QBF is the canonical complete problem for PSPACE, the class of problems solvable by a deterministic or nondeterministic Turing...

{\displaystyle P\subseteq NP\subseteq PP\subseteq PSPACE} , but it is possible that P = P S P A C E {\displaystyle P=PSPACE} . If P {\displaystyle P} is not equal...

the drawing rule in standard Checkers), then the problem is in PSPACE, thus it is PSPACE-complete. However, without this bound, Checkers is EXPTIME-complete...

are strict subsets, since we don't even know if P is a strict subset of PSPACE. BPP is contained in the second level of the polynomial hierarchy and therefore...

removing all tiles is PSPACE-complete, and the game is NP-complete if looking below tiles is allowed. It has been proven that it is PSPACE-hard to approximate...