Anne Condon, Joan Feigenbaum, Carsten Lund, Peter Shor  Home/Search
Context Related
| att.com/~jf/pubs/cjtcs95.ps wisc.edu/~condon/papers/cfls95.ps cs.ubc.ca/~condon/papers/cfls95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: counterpane.com/b...allauthorsS (more) From: wisc.edu/~condon/ Homepages: J.Feigenbaum |
Rate this article:      (best)Comment on this article |
Abstract: We initiate an investigation of probabilistically checkable debate systems (PCDS's), a natural generalization of probabilistically checkable proof systems. 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 is in PSPACE.... (Update)
Context of citations to this paper: More
.... have many other uses in complexity theory (or related areas like cryptography) One result in this direction is due to Condon et al. [34, 35], who use our main theorem (actually, a stronger form of it that we did not state) to prove a PCP style characterization of PSPACE. We...
Cited by: More
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (Correct)
Probabilistically Checkable Debate Systems and - Approximation Algorithms For (1993) (Correct)
Making Games Short (Extended Abstract) - Feige, Kilian (Correct)
Similar documents (at the sentence level):
40.3%: Probabilistically Checkable Debate Systems and.. - Condon, Feigenbaum.. (1995) (Correct)
Active bibliography (related documents): More All
0.4: Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (Correct)
0.3: Random Debaters and the Hardness of Approximating.. - Condon, Feigenbaum.. (1994) (Correct)
0.3: A Nonapproximability Result for Finite Function Generation - Jonsson Department Of (1997) (Correct)
Similar documents based on text: More All
0.7: The Relativized Relationship between Probabilistically.. - Russell, Sundaram (1993) (Correct)
0.7: The Relativized Relationship between Probabilistically.. - Russell, Sundaram (1993) (Correct)
0.2: Strong Bounds on the Approximability of Two PSPACE-hard Problems.. - Jonsson (Correct)
Related documents from co-citation: More All
12: Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
11: Random debaters and the hardness of approximating stochastic functions - Condon, Feigenbaum et al. - 1994
11: Johnson D.: Approximation algorithms for combinatorial problems. Jour. of Computer and Syst. Sci., 1974, 9, 256-278.
BibTeX entry: (Update)
A. Condon, J. Feigenbaum, C. Lund, and P. Shor. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (extended abstract). In Proceedings of the 25nd Annual ACM Symposium on the Theory of Computing, pages 305--314, 1993. http://citeseer.ist.psu.edu/50691.html More
@inproceedings{ condon93probabilistically,
author = "Anne Condon and Joan Feigenbaum and Carsten Lund and Peter Shor",
title = "Probabilistically checkable debate systems and approximation algorithms for {PSPACE-hard} functions",
pages = "305--314",
year = "1993",
url = "citeseer.ist.psu.edu/50691.html" }
Citations (may not include all citations):403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
146 Computers and Intractibility: A guide to the theory of NP-Co.. (context) - Garey, Johnson - 1979
122 How to recycle random bits - Impagliazzo, Zuckerman - 1989
79 Arthur-Merlin games: A randomized proof system and a hierarc.. (context) - Babai, Moran - 1988
56 Lower bounds for natural proof systems (context) - Kozen - 1977
54 and weak random sources (context) - Cohen, Wigderson et al. - 1989
43 Highly resilient correctors for polynomials - Gemmell, Sudan - 1992
41 Computer and System Sciences (context) - Papadimitriou, Yannakakis et al. - 1991
41 Computer and System Sciences (context) - Papadimitriou, nature - 1985
37 Probabilistic checking of proofs (context) - Arora, Safra - 1992
24 Probabilistically checkable debate systems and approximation.. - Condon, Feigenbaum et al. - 1993
24 Probabilistically checkable debate systems and approximation.. - Condon, Feigenbaum et al. - 1993
22 the complexity of some two-person perfect-information games (context) - Schaefer - 1978
19 Random debaters and the hardness of approximating stochastic.. - Condon, Feigenbaum et al. - 1994
15 Generalized CNF satisfiability problems and non-efficient ap.. (context) - Marathe, Stearns - 1994
15 Handbook of Game Theory (context) - Aumann, Hart - 1992
12 The complexity of the max word problem and the power of one-.. (context) - Condon - 1993
5 Private communication (context) - Bodlaender
5 Hierarchical specifications and polynomial-time approximatio.. (context) - Marathe, Stearns et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.counterpane.com/biblio/all-authors-S.html): More
A New Practical Algorithm for the Construction of a Perfect .. - Atici, Stinson, Wei (Correct)
Experimental Quantum Cryptography - Bennett, Bessette, Brassard.. (1992) (Correct)
Almost k-wise Independent Sample Spaces and Their.. - Kurosawa, Johansson.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC