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:   Print 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


Primary Entity

<http://www.worldcat.org/oclc/22643068> # On bounded round multi-prover interactive proof systems
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "22643068" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/24565526#Place/princeton_n_j> ; # Princeton, N.J.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
   schema:about <http://id.worldcat.org/fast/822777> ; # Automatic theorem proving
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/24565526#Person/lipton_richard_j> ; # Richard J. Lipton
   schema:contributor <http://experiment.worldcat.org/entity/work/data/24565526#Person/condon_anne> ; # Anne Condon
   schema:creator <http://viaf.org/viaf/85610385> ; # Jin-yi Cai
   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.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/24565526> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/24565526#Series/technical_report_princeton_university_dept_of_computer_science> ; # Technical report. Princeton University. Dept. of Computer Science ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/24565526#Series/technical_report> ; # Technical report ;
   schema:name "On bounded round multi-prover interactive proof systems"@en ;
   schema:productID "22643068" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/22643068#PublicationEvent/princeton_n_j_princeton_university_dept_of_computer_science_1989> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/24565526#Agent/princeton_university_dept_of_computer_science> ; # Princeton University, Dept. of Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/22643068> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/24565526#Agent/princeton_university_dept_of_computer_science> # Princeton University, Dept. of Computer Science
    a bgn:Agent ;
   schema:name "Princeton University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Organization/princeton_university_department_of_computer_science> # Princeton University. Department of Computer Science.
    a schema:Organization ;
   schema:name "Princeton University. Department of Computer Science." ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Person/condon_anne> # Anne Condon
    a schema:Person ;
   schema:familyName "Condon" ;
   schema:givenName "Anne" ;
   schema:name "Anne Condon" ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Person/lipton_richard_j> # Richard J. Lipton
    a schema:Person ;
   schema:familyName "Lipton" ;
   schema:givenName "Richard J." ;
   schema:name "Richard J. Lipton" ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Place/princeton_n_j> # Princeton, N.J.
    a schema:Place ;
   schema:name "Princeton, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/24565526#Organization/princeton_university_department_of_computer_science> ; # Princeton University. Department of Computer Science.
   schema:hasPart <http://www.worldcat.org/oclc/22643068> ; # On bounded round multi-prover interactive proof systems
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/24565526#Series/technical_report_princeton_university_dept_of_computer_science> # Technical report. Princeton University. Dept. of Computer Science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/22643068> ; # On bounded round multi-prover interactive proof systems
   schema:name "Technical report. Princeton University. Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/822777> # Automatic theorem proving
    a schema:Intangible ;
   schema:name "Automatic theorem proving"@en ;
    .

<http://viaf.org/viaf/85610385> # Jin-yi Cai
    a schema:Person ;
   schema:birthDate "1961" ;
   schema:familyName "Cai" ;
   schema:givenName "Jin-yi" ;
   schema:name "Jin-yi Cai" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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