Also found in: Wikipedia.
PSPACEPolynomial Space (complexity theory)
PSPACEPowerspace (band)
References in periodicals archive ?
If for each PSPACE Turing machine [tau] that decides [PI] we have that d([tau]) = 1, then P [not equal to] NP.
Moreover, we also removed all simultaneous EXP-time and PSPACE performers to finally end up with a collection of TMs.
Even more strikingly, Flake and Baum established that the seemingly simple Rush Hour is as difficult as any other problem that belongs in PSPACE.
Hearn and Demaine have already taken advantage of their techniques to show that a variety of sliding-block puzzles belongs in the PSPACE category, including simplified versions of Rush Hour in which all blocks are one-by-two rectangles, like dominoes, and can slide in any direction.
On the other hand, every locally generic active-semantics query in SO(R, +, *, 0, 1, [is less than]) is expressible in SO over L(SC, [is less than]) and thus has PSPACE data complexity, which proves the proposition.
Note that the implication problem [psi] [right arrow] [Psi] for [Psi] in [inverted] ACTL and [Psi] in [inverted] ACTL* is still in PSPACE.
It is left to prove PSPACE completeness for the validity problem of [inverted] ACTL*.
Until then, they were simply classified as NP-hard and in PSPACE.
This immediately implies a PSPACE lower bound for the complexity of CTL and CTL* model checking for concurrent programs.
1993; 1997] who use our main theorem (actually, a stronger form of it that we did not state) to prove a PCP-style characterization of PSPACE.
The simple (STRIPS) planning problem itself has been shown to be PSPACE complete (Bylander 1992); thus, for planning systems to handle problems large enough to be of interest, they must greatly reduce the size of the search space they traverse.
The beauty of Williams and Nayak's algorithm is its guarantee of a speedy response, which at first glance appears to contradict results showing STRIPS planning is PSPACE complete (Bylander 1991).