Query efficient PCPs with perfect completeness

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 610-619

  Håstad, Johan ^a   Khot, Subhash ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

AMORTIZED QUERY COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0035175817     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959937     Document Type: Article

References (15)

1. Proof verification and hardness of approximation problems
2. Probabilistic checking of proofs: A new characterization of NP
3. Free bits, PCP's and non-approximability - Towards tight results
4. Lower bounds for non-Boolean constraint satisfaction
5. A threshold of ln n for approximating set cover
6. Interactive proofs and the hardness of approximating cliques
7. Hardness of approximate hypergraph coloring
8. A new characterization of NP with 3 query PCPs
9. Some optimal inapproximability results
10. 1-ε
11. Simple analysis of graph tests for linearity and PCP
12. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring
13. A parallel repetition theorem
14. A PCP characterization of NP with optimal amortized query complexity