Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions

@article{Condon1995ProbabilisticallyCD,
  title={Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions},
  author={Anne Condon and Joan Feigenbaum and Carsten Lund and Peter W. Shor},
  journal={Chicago J. Theor. Comput. Sci.},
  year={1995},
  volume={1995}
}
We initiate an investigation of probabilistically checkable debate Abstract-1 systems (PCDS), a natural generalization of probabilistically checkable proof systems (PCPS). A PCDS for a language L consists of a probabilistic polynomial-time verifier V and a debate between player 1, who claims that the input x is in L, and player 0, who claims that the input x is not in L. We show that there is a PCDS for L in which V flips O(log n) random coins and reads O(1) bits of the debate if and only if L… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 21 references

On the complexity of some two-person perfect-information games

  • T. J. Schaefer
  • J. Computer and System Sciences, 16:185{225
  • 1978
Highly Influential
9 Excerpts

Hierarchical speci cations and polynomial-time approximation schemes for PSPACE- complete problems

  • M. Marathe, H. Hunt, R. Stearns, V. Radhakrishnan
  • Proc. 26th ACM Symposium on the Theory of Com…
  • 1994

H

  • C. Lund, L. Fortnow
  • Karlo , and N. Nisan. Algebraic methods for…
  • 1992

Similar Papers

Loading similar papers…