Sciweavers

Voted

TCS
2002

98views Theoretical Computer Science» more TCS 2002»

MAX3SAT is exponentially hard to approximate if NP has positive dimension

15 years 3 months ago

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers