Skip to search formSkip to main contentSkip to account menu

PSPACE-complete

Known as: PSPACE complete 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Known to be decidable since 1981, there still remains a huge gap between the best known lower and upper bounds for the reach… 
Highly Cited
2005
Highly Cited
2005
Recently, it has been shown that the small DL EL, which allows for conjunction and existential restrictions, has better… 
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… 
Highly Cited
1994
Highly Cited
1994
Highly Cited
1994
Highly Cited
1994
Highly Cited
1991
Highly Cited
1991
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… 
Highly Cited
1982
Highly Cited
1982
Highly Cited
1981
Highly Cited
1981