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:

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: John M. Hitchcock
• Keywords: Algorithm, Approximation, Positive P-dimension, TCS 2002, Theoretical Computer Science