Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions

From Tetherless World Wiki

\begin{bibtex} @article{DBLP:journals/cjtcs/CondonFLS95,

 author    = {Anne Condon and
              Joan Feigenbaum and
              Carsten Lund and
              Peter W. Shor},
 title     = {Probabilistically Checkable Debate Systems and Nonapproximability
              of PSPACE-Hard Functions},
 journal   = {Chicago J. Theor. Comput. Sci.},
 volume    = {1995},
 year      = {1995},
 ee        = {http://cjtcs.cs.uchicago.edu/articles/1995/4/contents.html},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}