Complete classification of the approximability of maximization problems derived from boolean constraint satisfaction

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 11-20

  Khanna, Sanjeev ^a   Sudan, Madhu ^a   Williamson, David P ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BOOLEAN CONSTRAINT SATISFACTION PROBLEMS (CSP); POLYNOMIAL TIME;

BOOLEAN FUNCTIONS;

EID: 0030646744     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)