Testing of the long code and hardness for Clique

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 11-19

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; CODES (SYMBOLS); ENCODING (SYMBOLS); POLYNOMIALS; PROBABILITY; THEOREM PROVING;

CODE-WORDS; LONG CODES; MAX CLIQUE; POLYNOMIAL-TIME; PROOF SYSTEM;

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY;

CODE WORD; FREE BITS; LOGARITHMIC RANDOMNESS; LONG CODE; MAX CLIQUE; PROOF SYSTEM;

EID: 0029712043     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237820     Document Type: Conference Paper

References (15)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN AND M. SZEGEDY. Proof verification and intractability of approximation problems. 33rd FOCS, 1992, pp 14-23.
2. S. ARORA AND S. SAFRA. Probabilistic checking of proofs: a new characterization of NP. 33rd FOCS, 1992 2-13.
3. M. BELLARE, O. GOLDREICH AND M. SUDAN Free Bits, PCPs and Non-Approximability-Towards tight Results. 36th FOCS, 1995, pp 422-431. See also a more complete version available from ECCC.
4. M. BELLARE, S. GOLDWASSER, C. LUND AND A. RUSSELL. Efficient probabilistically checkable proofs and applications to approximation. 25th STOC, 1993, pp 294-304.
5. (See also Errata sheet in STOC94).
6. M. BELLARE AND M. SUDAN. Improved nonapproximability results. 26th STOC, 1994, pp 184-193.
7. R. BOPPANA AND M. HALDÓRSSON. Approximating maximum independent sets by excluding subgraphs. BIT, Vol. 32, No. 2, 1992.
8. p product spaces. In Seminaire D'Analyse Fonctionnelle, pages 4.1-4.9. Ecole Polytechnique, Centre De Mathematiques, 1979-80.
9. U. FEIGE. Randomized graph products, chromatic numbers, and the Lovász θ-function. 27th STOC 1995 pp 635-640.
10. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY. Approximating clique is almost NP-complete. 32nd FOCS 1991, pp 2-12.
11. U. FEIGE AND J. KILIAN. Two prover protocols - Low error at affordable rates. 26th STOC, 1994, pp 172-183.
12. L. FORTNOW, J. ROMPEL AND M. SLPSER. On the power of multiprover interactive protocols. Proceedings of the 3rd Structures, IEEE, 1988.
13. 1-∈, manuscript, 1996.
14. R. RAZ. A parallel repetition theorem. 27th STOC, 1995, pp 447-456.
15. D. ZUCKERMAN NP-complete problems have a version that is hard to approximate. Proceedings of the Eighth Annual Conference on Structure in Complexity Theory, 1993.