Approximate solutions to problems in PSPACE

Games against nature

Journal of Computer and System Sciences

IP = PSPACE

Journal of the ACM (JACM)

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

P-Complete Approximation Problems

Journal of the ACM (JACM)

Alternation

Journal of the ACM (JACM)

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming

Exploiting Hierarchy in VLSI Design

Proceedings of the VLSI Algorithms and Architectures, Aegean Worksho on Computing

The complexity of dynamic languages and dynamic optimization problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

On approximation algorithms for hierarchical MAX-SAT

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)