P. Feldman. The optimal prover lives in PSPACE. manuscript, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Helping and Interactive Proof Systems - Arvind, Köbler, Schuler (1995) (2 citations) (Correct)
....the answers do not depend on the history of interaction. An interesting issue that arises in interactive proof systems which is also the main concern of this paper is bounding the complexity of the honest prover(s) that make the verifier accept a given language. For example, it is known ([Fe86, Sh90]) that each language in PSPACE has an IP protocol with prover of complexity PSPACE. The result of Lund et al. LFKN92] implies that P PP has IP protocols with prover complexity PP. Similarly, EXP has MIP protocols of prover complexity EXP [BFL91] An important aspect of bounding prover ....
....the class of languages with prover complexity bounded by FP(C) i.e. the class of functions computable by polynomial time bounded transducers with access to an oracle from the class C) In this notation we summarize some of the known results on upper bounds for prover complexity. Theorem 1.1 1. [Fe86, Sh90] PSPACE = IP[PSPACE] 2. LFKN92] P PP IP[PP] 3. BF91] PhiP IP[ PhiP] 4. BFL91] NEXP = MIP[EXP NP ] 5. BFL91] EXP = MIP[EXP] 2 A surprising application of Theorem 1.1 to classical structural complexity is the following corollary. Corollary 1.2 [LFKN92, BFL91] For K 2 fPP; ....
P. Feldman. The optimal prover lives in PSPACE. manuscript, 1986.
On the Role of Shared Randomness in Two Prover Proof Systems - Bellare, Feige, Kilian (1995) (Correct)
....that b Gamma f ffl(x) 2. Combining these inequalities gives a Gamma b ffl(x) Now each P i is a single prover trying to convince a polynomial time verifier in conjunction with T i x . But this is equivalent to a single prover proof system with input (x; T i x ) Hence, by the result of [8] there exists an optimal P i [T i x ] that is computable in PSPACE on input (x; T i x ) 3.4 Eliminating the advice To complete the proof of Theorem 1.1, we show that useful (T 1 x ; T 2 x ) can be generated in PSPACE from input x. First, we note that Feldman s proof that ....
P. Feldman. The optimal prover lives in PSPACE. Manuscript.
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