Anne Condon, Joan Feigenbaum, Carsten Lund, Peter Shor  Home/Search
Context Related
| siam.org/sambin/getfile/S...26073.ps.Z From: siam.org/sambin/dbq/arti...26073 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A probabilistically checkable debate system (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. It is known that there is a PCDS for L in which V flips O(log n) coins and reads O(1) bits of the debate if and only if L is in PSPACE [A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Chicago J. Theoret. Comput. Sci., 1995, No. 4]. In this paper, we ... (Update)
Context of citations to this paper: More
.... techniques have found many other theoretical applications in complexity theory and cryptography, including new definitions of PSPACE [40] and PH [92] probabilistically checkable codes, zero knowledge proofs, checkable VLSI computations, etc. See [3] for a survey. One...
...x ## L, there is no y with y # q( x ) and with V (x, y) accepting with probability # 1 4. This idea can also be extended to pspace [10, 9], using a game that alternates between two players instead of a proof presented by a single player. Since the construction of reliable...
Cited by: More
Making Games Short (Extended Abstract) - Feige, Kilian (Correct)
Proof Verification and the Hardness of Approximation.. - Arora, Lund, Motwani.. (1992) (Correct)
Strong Bounds on the Approximability of Two PSPACE-hard Problems.. - Jonsson (Correct)
Similar documents (at the sentence level):
41.1%: Random Debaters and the Hardness of Approximating Stochastic.. - Condon (1993) (Correct)
Active bibliography (related documents): More All
0.4: The Approximability of NP-hard Problems - Arora (1998) (Correct)
0.3: Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
0.3: A Parallel Repetition Theorem - Raz (1998) (Correct)
Similar documents based on text: More All
0.6: Probabilistically Checkable Debate Systems and.. - Condon, Feigenbaum.. (1995) (Correct)
0.3: Probabilistically Checkable Debate Systems and - Approximation Algorithms For (1993) (Correct)
0.3: On Coherence, Random-Self-Reducibility, and.. - Feigenbaum, Fortnow.. (1998) (Correct)
Related documents from co-citation: More All
15: Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
12: Proof verification and hardness of approximation problems - Lund, Motwani et al. - 1992
11: Probabilistically checkable debate systems and approximation algorithms for PSPA.. - Condon, Feigenbaum et al. - 1993
BibTeX entry: (Update)
A. Condon, J. Feigenbaum, C. Lund, and P. Shor. Random debaters and the hardness of approximating stochastic functions. In Proc. 9-th Annual IEEE Conference on Structure in Complexity Theory, pages 280--293. IEEE Computer Society Press, Los Alamitos, California, 1994. Full version to appear in SIAM Journal of Computing. http://citeseer.ist.psu.edu/condon97random.html More
@inproceedings{ condon94random,
author = "Anne Condon and Joan Feigenbaum and Carsten Lund and Peter W. Shor",
title = "Random Debaters and the Hardness of Approximating Stochastic Functions",
booktitle = "Structure in Complexity Theory Conference",
pages = "280-293",
year = "1994",
url = "citeseer.ist.psu.edu/condon97random.html" }
Citations (may not include all citations):403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992 DBLP
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
274 A catalog of complexity classes (context) - Johnson - 1990 ACM DBLP
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992 ACM DBLP
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
141 The complexity of finite functions (context) - Boppana, Sipser - 1990 ACM DBLP
108 Improved non-approximability results - Bellare, Sudan - 1994 ACM DBLP
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996 DBLP
79 Arthur--Merlin games: A randomized proof system and a hierar.. (context) - Babai, Moran - 1988
58 Games against nature (context) - Papadimitriou - 1985
37 Probabilistic checking of proofs (context) - Arora, Safra - 1992 ACM
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. - 1993
16 A combinatorial problem which is complete in polynomial spac.. (context) - Even, Tarjan - 1976
15 Generalized CNF satisfiability problems and non-e#cient appr.. (context) - Marathe, Stearns - 1994
11 the complexity of some coloring games - Bodlaender - 1991
10 The complexity of approximating PSPACE-complete problems for.. (context) - Marathe, Ravi - 1994 ACM
9 A theorem on probabilistic constant depth circuits (context) - Ajtai, Ben-Or - 1984
7 The complexity of dynamic languages and dynamic optimization.. (context) - Orlin - 1981
3 cient checking of polynomials and proofs and the hardness of.. (context) - Sudan - 1992
3 cient probabilistic checkable proofs and applications to app.. (context) - Bellare, Goldwasser et al. - 1993
The graph only includes citing articles where the year of publication is known.
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