Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions

Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chicago J. Theor. Comput. Sci., 1995, 1995. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: