V. Arvind, J. Köbler, R. Schuler  Home/Search
Context Related
| samy.informatik.huberl...helping.ps.gz 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: samy.informatik.h...publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the complexity of honest provers in interactive proof systems. This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive protocols with provers that are reducible to sets of low information content are considered. Specifically, if the verifier communicates only with provers in P=poly, then the accepted language is low... (Update)
Context of citations to this paper: More
.... of robustness of oracle machines was introduced by Schoning [Sch85] and subsequently investigated in various ways, e.g. [Ko87, Sch88, HH90, AKS95, NRS95]. A robust oracle machine is a standard oracle Turing machine accepting the same set relative to every oracle. Because of...
...with honest prover in P poly. We show that IP[P poly] Low(ZPP NP ) improving the containment IP[P poly] Low( Sigma p 2 ) shown in [2]. Our proof has a derandomization component in which the Nisan Wigderson pseudorandom generator [21] is used to derandomize the verifier in...
Cited by: More
New Lowness Results for ZPP^NP and other Complexity Classes - Arvind, Köbler (Correct)
Derandomization and Distinguishing Complexity - Allender, Koucky, Ronneburger.. (2003) (Correct)
Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (2000) (Correct)
Active bibliography (related documents): More All
0.5: Applications of Universal Hashing in Complexity Theory - Arvind, Mahajan (Correct)
0.5: On the Role of Shared Randomness in Two Prover Proof Systems - Bellare, Feige, Kilian (1995) (Correct)
0.2: Counting Hierarchies: Polynomial Time And Constant Depth.. - Allender, Wagner (1990) (Correct)
Similar documents based on text: More All
0.1: Interactive Verification of co-NP Statements - March In This (Correct)
0.1: Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Vinodchandran (1999) (Correct)
0.1: If NP has Polynomial-Size Circuits, then MA = AM - Arvind, Köbler, Schöning.. (1995) (Correct)
Related documents from co-citation: More All
4: EATCS Monographs on Theoretical Computer Science (context) - Balc'azar, D'iaz et al. - 1988
4: Hardness vs randomness (context) - Nisan, Wigderson - 1994
4: Some connections between nonuniform and uniform complexity classes (context) - Karp, Lipton - 1980
BibTeX entry: (Update)
V. Arvind, J. K obler, and R. Schuler. On helping and interactive proof systems. International Journal of Foundations of Computer Science, 6(2):137--153, 1995. http://citeseer.ist.psu.edu/arvind95helping.html More
@inproceedings{ arvind94helping,
author = "Arvind and Kobler and Schuler",
title = "On Helping and Interactive Proof Systems",
booktitle = "{ISAAC}: 5th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1994",
url = "citeseer.ist.psu.edu/arvind95helping.html" }
Citations (may not include all citations):534 The complexity of theorem proving procedures (context) - Cook - 1971
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
192 Designing programs that check their work - Blum, Kannan - 1989
173 Trading group theory for randomness (context) - Babai - 1985
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
116 Some connections between nonuniform and uniform complexity c.. (context) - Karp, Lipton - 1980
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
98 EATCS Monographs on Theoretical Computer Science (context) - Balc'azar, D'iaz et al. - 1988
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1989
93 the power of multiprover interactive protocols - Fortnow, Rompel et al. - 1988
83 Multiprover interactive proofs: How to remove the intractabi.. (context) - Ben-Or, Goldwasser et al. - 1988
79 Arthur-Merlin games: a randomized proof system and a hierarc.. (context) - Babai, Moran - 1988
73 Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
65 Journal of ACM (context) - Shamir, PSPACE - 1992
40 Arithmetization: A new method in structural complexity - Babai, Fortnow - 1991
38 Information and Control (context) - Book, complexity - 1974
32 The strong exponential hierarchy collapses (context) - Hemachandra - 1989
27 On helping by robust oracle machines (context) - Ko - 1987
25 Optimal algorithms for self-reducible problems (context) - Schnorr
23 On relativized exponential and probabilistic complexity clas.. (context) - Heller - 1986
20 Probabilistic complexity classes and lowness (context) - Schoning - 1989
18 Strong nondeterministic polynomial-time reducibilities (context) - Long - 1982
18 Are there interactive protocols for co-NP languages - Fortnow, Sipser - 1988
14 A decisive characterization of BPP (context) - Zachos, Heller - 1986
13 the non-uniform complexity of the graph isomorphism problem (context) - Lozano, Tor'an - 1993
12 Robust algorithms: a different approach to oracles (context) - Schoning - 1985
2 A complexity theory approach to randomness (context) - Sipser - 1983
2 The optimal prover lives in PSPACE (context) - Feldman - 1986
1 th Mathematical Foundations of Computer Science (context) - Schoning, machines - 1988
1 Bounding the complexity of advice functions (context) - Gavalda - 1992
1 th Foundations of Software Technology and Theoretical Comput.. (context) - Buhrman, Homer et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://samy.informatik.hu-berlin.de/Institut/struktur/algorithmenII/publikationen.html): More
Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (2000) (Correct)
On Distribution-Specific Learning With Membership Queries.. - Köbler, Lindner (Correct)
Is the Standard Proof System for SAT P-optimal? (Extended.. - Köbler, Messner (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