On the power of unique 2-prover 1-round games

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 767-775

  Khot, Subhash ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; LINEAR EQUATIONS; MATHEMATICAL PROGRAMMING; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

PROBABILISTIC CHECKABLE PROOF; ROUND GAMES; SEMIDEFINITE PROGRAMMING; UNIQUE GAMES CONJECTURE;

GAME THEORY;

EID: 0036040281     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.510017     Document Type: Conference Paper

References (23)

1. Approximating the independence number via the θ-function
2. A new way of using semidefinite programming with applications to linear equations mod p
3. Proof verification and the hardness of approximation problems
4. Probabilistic checking of proofs: A new characterization of np
5. Free bits, pcps and non-approximability
6. On the distribution of the fourier spectrum of boolean functions
7. The importance of being biased
8. Error reduction - The state of the art
9. A threshold of ln n for approximating set cover
10. Two-prover one-round proof systems, their power and their problems
11. Improved approximation algorithms for max k-cut and max bisection
12. 0.878 approximation algorithms for max-cut and max-2sat
13. Hardness of approximate hypergraph coloring
14. 1-ε
15. Some optimal inapproximability results
16. On a protocol possibly useful for min-2sat
17. On the hardness of max k-cut and its dual
18. Hardness results for approximate hypergraph coloring
19. Approximation algorithms for steiner and directed multicuts
20. A parallel repetition theorem
21. A pcp characterization of np with optimal amortized query complexity
22. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
23. Finding almost satisfying assignments