Relations between average case complexity and approximation complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 5-

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036290677     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Short proofs are narrow - Resolution made simple
2. Recognizing more unsatisfiable random 3SAT instances efficiently
3. Some optimal inapproximability results