Article

Free access

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

Authors:

Anne Condon,

Joan Feigenbaum,

Carsten Lund,

Peter ShorAuthors Info & Claims

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

Pages 305 - 314

https://doi.org/10.1145/167088.167190

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

S. Arora, C. Lund, 1#. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd Symposium on Foundations of Computer Science, IE, EE Computer Society Press, Los Alamitos, 1992, pp. 14- 23.

Digital Library

Google Scholar

[2]

S. Arora and M. Safra, Probabilistic Checking of Proofs, Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1992, pp. 2-13.

Google Scholar

[3]

L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking Computations in Polylogarithmic Time, Proc. 23rd Symposium on Theory of Computing, ACM, New York, 1991, pp. 21-31.

Digital Library

Google Scholar

[4]

L. Babai and S. Moran, Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, J. Comput. System Sci., 36 (1988), pp. 254-276.

Digital Library

Google Scholar

[5]

E. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes, US Patent Number 4,633,470. Appears in {10}.

Google Scholar

[6]

A. Condon, j. Feigenbaum, C. Lund, and P. Shot, Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE- Hard Functions, AT#T Bell Laboratories Technical Memorandum, January 12, 1993.

Google Scholar

[7]

A. K. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114- 133.

Digital Library

Google Scholar

[8]

U. Feige, S. Goldwasser, L. Lov~sz, M. Safra, and M. Szegedy, Approximating Clique is Almost NP-Complete, Proc. 32nd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1991, pp. 2-12.

Digital Library

Google Scholar

[9]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, San Francisco, {979.

Digital Library

Google Scholar

[10]

P. Gemmell and M. Sudan. Highly resilient coffeetots for polynomials, Inf. Proc. Letters, 4.3 (1992), pp. 169-174.

Digital Library

Google Scholar

[11]

D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.

Digital Library

Google Scholar

[12]

D. Kozen, Lower bounds for natural proof systems, Proc. 18th Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1977, pp. 254-266.

Digital Library

Google Scholar

[13]

C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.

Digital Library

Google Scholar

[14]

C. Papadimitriou. Games Agains# Nalure, J. Comput. System Sci., 31 (1985), pp. 288-301.

Digital Library

Google Scholar

[15]

C. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes, J. Comput. System Sci., 43 (1991), pp. 425-440.

Crossref

Google Scholar

[16]

R. Rubinfeld and M. Sudan. Testing polynomial functions efficiently and over rational domains, Proc. 3rd Symposium on Discrete Algorithms, ACM/SIAM, 1992, pp. 23-32. A more efficient tester is to appear in journal version.

Digital Library

Google Scholar

[17]

T. J. Schaefer, On the Complexity of Some Two-Person Perfect-Information Games, J. Cornput. System Sci., 16 (1978), pp. 185-225.

Crossref

Google Scholar

[18]

A. Shamir. IF = PSPACE, J. ACM, 39 (1992), pp. 869-877.

Digital Library

Google Scholar

Cited By

View all

Demirci HSay AYakaryılmaz A(2015)The Complexity of Debate CheckingTheory of Computing Systems10.1007/s00224-014-9547-757:1(36-80)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/s00224-014-9547-7
Yakaryılmaz ASay ADemirci H(2014)Debates with Small Transparent Quantum VerifiersDevelopments in Language Theory10.1007/978-3-319-09698-8_29(327-338)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09698-8_29
Hunt HRavi SMarathe MRosenkrantz DRadhakrishnan VStearns R(2006)A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphsAlgorithms — ESA '9410.1007/BFb0049428(424-435)Online publication date: 23-Feb-2006
https://doi.org/10.1007/BFb0049428
Show More Cited By

Index Terms

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation

Recommendations

Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE

In 1990, PSPACE was shown to be identical to IP, the class of languages with interactive proofs [18,20]. Recently, PSPACE was again recharacterized, this time in terms of (Random) Probabilistically Checkable Debate Systems [7,8]. In particular, it was ...
Probabilistically Checkable Proofs Over the Reals

Probabilistically checkable proofs (PCPs) have turned out to be of great importance in complexity theory. On the one hand side they provide a new characterization of the complexity class NP, on the other hand they show a deep connection to approximation ...

Comments

Information & Contributors

Information

Published In

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

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
361
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)5

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Demirci HSay AYakaryılmaz A(2015)The Complexity of Debate CheckingTheory of Computing Systems10.1007/s00224-014-9547-757:1(36-80)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/s00224-014-9547-7
Yakaryılmaz ASay ADemirci H(2014)Debates with Small Transparent Quantum VerifiersDevelopments in Language Theory10.1007/978-3-319-09698-8_29(327-338)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09698-8_29
Hunt HRavi SMarathe MRosenkrantz DRadhakrishnan VStearns R(2006)A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphsAlgorithms — ESA '9410.1007/BFb0049428(424-435)Online publication date: 23-Feb-2006
https://doi.org/10.1007/BFb0049428
Lin C(2005)Hardness of approximating graph transformation problemAlgorithms and Computation10.1007/3-540-58325-4_168(74-82)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-58325-4_168
Marathe MHunt HRavi S(2005)The complexity of approximating PSPACE-complete problems for hierarchical specificationsAutomata, Languages and Programming10.1007/3-540-56939-1_63(76-87)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-56939-1_63
Szegedy M(2005)Probabilistic Verification and Non-ApproximabilityHandbook of Combinatorial Optimization10.1007/0-387-23830-1_3(83-191)Online publication date: 2005
https://doi.org/10.1007/0-387-23830-1_3
Hemaspaandra L(2002)SIGACT news complexity theory column 38ACM SIGACT News10.1145/601819.60182933:4(22-36)Online publication date: 1-Dec-2002
https://dl.acm.org/doi/10.1145/601819.601829
Hemaspaandra L(2002)SIGACT news complexity theory comun 37ACM SIGACT News10.1145/582475.58248433:3(32-49)Online publication date: 1-Sep-2002
https://dl.acm.org/doi/10.1145/582475.582484
Stearns RHunt H(2002)Exploiting structure in quantified formulasJournal of Algorithms10.1016/S0196-6774(02)00002-043:2(220-263)Online publication date: 1-May-2002
https://dl.acm.org/doi/10.1016/S0196-6774%2802%2900002-0
Arora SVitter J(1998)The approximability of NP-hard problemsProceedings of the thirtieth annual ACM symposium on Theory of computing10.1145/276698.276784(337-348)Online publication date: 23-May-1998
https://dl.acm.org/doi/10.1145/276698.276784
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions

The relativized relationship between probabilistically checkable debate systems, IP and PSPACE

Probabilistically Checkable Proofs Over the Reals