MAX3SAT is exponentially hard to approximate if NP has positive dimension

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 861-869

  M Hitchcock, John ^a  

^a Iowa State University   (United States)

Author keywords

Inapproximability; MAX3SAT; Resource bounded dimension; Resource bounded measure

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; OPTIMIZATION; POLYNOMIALS;

RESOURCE-BOUNDED DIMENSIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0037163961     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00340-1     Document Type: Article

References (9)

1. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press/McGraw-Hill, Cambridge, MA.
2. E. Dantsin, M. Gavrilovich, E.A. Hirsch, B. Konev, MAX SAT approximation beyond the limits of polynomial-time approximation, Ann. Pure Appl. Logic, to appear.
3. E. Halperin, U. Zwick, Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs, IPCO: 7th Integer Programming and Combinatorial Optimization Conference, Graz, Austria, 1999.
4. J. Håstad, Some optimal inapproximability results, Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 1-10.
5. H. Karloff, U. Zwick, A 7/8-approximation algorithm for MAX 3SAT? 38th Ann. Symp. on Foundations of Computer Science, 1997, pp. 406-415.
6. Lutz J.H. Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44:1992;220-258.
7. J.H. Lutz, Dimension in complexity classes, in: Proc. 15th Ann. IEEE Conf. Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 2000, pp. 158-169.
8. Lutz J.H., Mayordomo E. Twelve problems in resource-bounded measure. Bull. European Assoc. Theoret. Comput. Sci. 68:1999;64-80.
9. Lutz J.H., Mayordomo E. Measure, stochasticity, and the density of hard languages. SIAM J. Comput. 23(4):1994;762-779.