NP-complete problems have a version that is hard to approximate

Proceedings of the Eighth Annual Structure in Complexity Theory Conference

Volumn , Issue , 1993, Pages 305-312

  Zuckerman, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; POLYNOMIALS;

COUNTING PROBLEMS; INTRACTABLE APPROXIMATIONS; ITERATED LOGARITHMS; KARP'S NP-COMPLETE PROBLEMS; OPTIMIZATION PROBLEMS; SUPERPOLYNOMIAL RANDOMIZED MACHINES; UNAPPROXIMABLE PROBLEMS;

SET THEORY;

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

References (16)