Two-prover protocols - low error at affordable rates

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 324-346

  Feige, U ^a   Kilian, J ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Complexity theory; Interactive proof systems

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY; RANDOM PROCESSES;

COMPLEXITY THEORY; INTERACTIVE PROOF SYSTEMS; TWO-PROVER SYSTEMS;

THEOREM PROVING;

EID: 0034457132     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797325375     Document Type: Article

References (22)

1. Proof verification and hardness of approximation problems
2. Efficient probabilistic checkable proofs and applications to approximation
3. Free bits, PCPs, and nonapproximability-towards tight results
4. Improved non-approximability results
5. Multi prover interactive proofs: How to remove intractibility assumptions
6. On bounded round multi-prover interactive proof systems
7. Playing games of incomplete information
8. PSPACE is provable by two provers in one round
9. On the success probability of the two provers in one round proof systems
10. Error reduction by parallel repetition-the state of the art
11. Two prover protocols-low error at affordable rates
12. Two-prover one-round proof systems, their power and their problems
13. Error reduction by parallel repetition-a negative example
14. On the power of multi-prover interactive protocols
15. 1-ε
16. The influence of variables on Boolean functions
17. A one-round, two-prover, zero-knowledge protocol for NP
18. Fully parallelized multi prover protocols for NEXP-time
19. On the hardness of approximating minimization problems
20. A parallel repetition theorem
21. Towards the parallel repetition conjecture