On the advantage over a random assignment

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 43-52

  Håstad, Johan ^a   Venkatesh, S ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; FOURIER TRANSFORMS; LINEAR EQUATIONS; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

BOOLEAN PREDICATE; CONSTRAINT SATISFACTION PROBLEM; DERANDOMIZATION; FOURIER ANALYSIS;

OPTIMIZATION;

EID: 0036036831     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509914.509916     Document Type: Conference Paper

References (14)

1. Derandomized graph products
2. The probabilistic method
3. Proof verification and intractability of approximation problems
4. Probabilistic checking of proofs: A new characterization of NP
5. Free bits, PCPs and non-approximability-towards tight results
6. The complexity of approximating a nonlinear program
7. p product spaces. In seminaire d'analyse fonctionnelle
8. Noise-tolerant learning, the parity problem and the statistical query model
9. 1-o(1)
10. Hardness results for approximate hypergraph coloring
11. Inapproximability results for Max-Clique, chromatic number and approximate graph coloring
12. Some optimal inapproximability results
13. Ramanujan graphs
14. A parallel repetition theorem