Abstract
A major open problem in the theory of multi-prover interactive proofs is to characterize the languages which can be accepted by fully parallelized multi-prover protocols with an exponentially low probability of cheating. In this paper we solve this problem by proving that any language which can be accepted by a sequential multi-prover protocol can also be accepted by a single-round multi-party protocol, and thus the multi-prover round hierarchy collapses to its first level: MIP(poly)=MIP(1)=NEXP-time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
