Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Gus Gutoski:

TR10-187 | 3rd December 2010
Gus Gutoski

Interactive proofs with competing teams of no-signaling provers

Revisions: 2

This paper studies a generalization of multi-prover interactive proofs in which a verifier interacts with two competing teams of provers: one team attempts to convince the verifier to accept while the other attempts to convince the verifier to reject. Each team consists of two provers who jointly implement a no-signaling ... more >>>

ISSN 1433-8092 | Imprint