Sciweavers

TCS
2002

MAX3SAT is exponentially hard to approximate if NP has positive dimension

13 years 10 months ago
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
John M. Hitchcock
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TCS
Authors John M. Hitchcock
Comments (0)