Clique is hard to approximate within n1-ε

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 627-636

  Hastad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS;

APPROXIMATION ALGORITHM; MAX CLIQUE; POLYNOMIAL TIME;

COMPUTATION THEORY;

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

References (12)