Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

PSPACE

Known as: PSPACE-hard, NPSPACE, Polynomial space 
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand
  • table 1
  • table 3
Highly Cited
2004
Highly Cited
2004
We prove that satisfiability problem for word equations is in PSPACE. 
  • figure 1
  • figure 2
Highly Cited
1998
Highly Cited
1998
We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
Highly Cited
1997
Highly Cited
1997
It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata ((nite tape Turing Machine (TM)). In… Expand
  • figure 9
Highly Cited
1992
Highly Cited
1992
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in… Expand
Highly Cited
1988
Highly Cited
1988
We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial… Expand
Highly Cited
1979
Highly Cited
1979
Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in… Expand
  • figure 1
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand