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â€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Rahul Jain, Zheng-Feng Ji, Sarvagya Upadhyay, John Watrous
- STOC
- 2010

The interactive proof system model of computation has been studied extensively in computational complexity theory and theoreticalâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Paul S. Bonsma, Luis Cereceda
- MFCS
- 2007

Suppose we are given a graph G together with two proper vertex k-colourings of G, Î± and Î². How easily can we decide whether it isâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Robert A. Hearn, Erik D. Demaine
- Theor. Comput. Sci.
- 2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum inâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Wojciech Plandowski
- FOCS
- 1999

We prove that satisfiability problem for word equations is in PSPACE.Â

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- John Watrous
- FOCS
- 1999

In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover andâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Rajeev Alur, David L. Dill
- Theor. Comput. Sci.
- 1994

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&eâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Adi Shamir
- FOCS
- 1990

In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified inâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- John F. Canny
- STOC
- 1988

We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomialâ€¦Â (More)

Is this relevant?

1981

1981

- Stefan Reisch
- Acta Informatica
- 1981

There are a number of board games such as Checkers [2], Go [5], and Gobang [8], which are known to be PSPACE-hard. This meansâ€¦Â (More)

Is this relevant?

1980

1980

- Stefan Reisch
- Acta Informatica
- 1980

For many games, the decision problem of whether a player in a given situation has a winning strategy has been shown to be PSPACEâ€¦Â (More)

Is this relevant?