skip to content
On bounded round multi-prover interactive proof systems Preview this item
ClosePreview this item
Checking...

On bounded round multi-prover interactive proof systems

Author: Jin-yi Cai; Anne Condon; Richard J Lipton
Publisher: Princeton, N.J. : Princeton University, Dept. of Computer Science, 1989.
Series: Princeton University.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jin-yi Cai; Anne Condon; Richard J Lipton
OCLC Number: 22643068
Notes: "December 1989."
Description: 9 pages ; 28 cm.
Series Title: Princeton University.; Department of Computer Science.; Technical report
Responsibility: Jin-yi Cai, Anne Condon, Richard J. Lipton.

Abstract:

Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/22643068>
library:oclcnum"22643068"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/22643068>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:author
schema:contributor
schema:contributor
schema:datePublished"1989"
schema:description"Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/24565526>
schema:inLanguage"en"
schema:name"On bounded round multi-prover interactive proof systems"
schema:publisher
rdf:typeschema:Organization
schema:name"Princeton University, Dept. of Computer Science"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.