MAX3SAT is exponentially hard to approximate if NP has positive dimension (2002) [24 citations — 12 self]
Download:
|
|
by John M. Hitchcock
Theoretical Computer Science
http://www.cs.iastate.edu/~jhitchco/papers/meha.ps
Add To MetaCart
Abstract:
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:
Citations
| 5825 | Introduction to Algorithms – Cormen, Leiserson, et al. - 2001 |
| 383 | Some optimal inapproximability results – HËšastad |
| 159 | Almost everywhere high nonuniform complexity – Lutz - 1992 |
| 87 | A 7/8-approximation algorithm for MAX 3SAT – Karloff, Zwick - 1997 |
| 68 | Dimension in complexity classes – Lutz - 2003 |
| 46 | Measure, stochasticity, and the density of hard languages – Lutz, Mayordomo - 1994 |
| 21 | Approximation algorithms for MAX 4-SAT and rounding proceduresfor semidefinite programs – Halperin, Zwick - 1999 |
| 19 | Twelve problems in resource-bounded measure. Bulletin of the European Association for Theoretical Computer Science – Lutz, Mayordomo - 1999 |
| 6 | SAT approximation beyond the limits of polynomial-time approximation – MAX |
