Free bits, PCPs and non-approximability - towards tight results

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1995, Pages 422-431

  Bellare, Mihir ^a   Goldreich, Oded ^a   Sudan, Madhu ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CODING ERRORS; ERROR CORRECTION; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES;

CHROMATIC NUMBER; LONG CODE; MAX CLIQUE; NON-APPROXIMABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0029519801     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)