Johan Håstad
Skip Abstract Section
Abstract
We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover.
- AMALDI, E., AND KANN, V. 1995. The complexity and approximability of finding feasible subsystems of linear relations. Theoret. Comput. Sci. 147, 181-210. Google Scholar
Digital Library
- ANDERSSON, G., ENGEBRETSEN, L., AND H~STAD, J. 1999. A new way to use semidefinite programming with applications to linear equations mod p. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms Baltimore, Md., Jan. 17-19. ACM New York, pp. 41-50. Google ScholarDigital Library
- ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1998. Proof verification and intractability of approximation problems. J. ACM 45, 3 (May), 501-555. Google ScholarDigital Library
- ARORA, S., AND SAFRA, S. 1998. Probabilistic checking of proofs: a new characterization of NP. J. ACM 45, 1 (Jan.) 70-122. Google ScholarDigital Library
- BABAI, L., FORTNOW, L., LEVIN, L., AND SZEGEDY, M. 1991b Checking computations in polylogarithmic time. In Proceedings of the 23rd Annual Symposium on the Theory of Computation (New Orleans, La., May 6-8). ACM, New York, pp. 21-31. Google ScholarDigital Library
- BABAI, L., FORTNOW, L., AND LUND, C. 1991a Non-deterministic exponential time has two-prover interactive protocols. Computat. Compl. 1, 3-40.Google ScholarCross Ref
- BAR-YEHUDA, R., AND EVEN, S. 1981. A linear time approximation algorithm for the weighted vertex cover algorithm. J. Algorithms 2, 198-210.Google ScholarCross Ref
- BELLARE, M., COPPERSMITH, D., H~STAD, J., KIWI, M., AND SUDAN, M. 1996. Linearity testing in characteristic two. IEEE Trans. Inf. Theory 42, 6 (Nov.), 1781-1796. Google ScholarCross Ref
- BELLARE, M., GOLDREICH, O., AND SUDAN, M. 1998. Free Bits, PCPs and Non-Approximability- Towards tight Results. SIAM J. Comput. 27, 804-915. Google ScholarDigital Library
- BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. 1993. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th Annual ACMSymposium on Theory of Computation (San Diego, Calif., May 16-18). ACM, New York, pp. 294-304. (See also Errata sheet in Proceedings of the 26th Annual ACM Symposium on Theory of Computation (Montreal, Que., Canada). ACM, New York, p. 820). Google ScholarDigital Library
- BELLARE, M., AND SUDAN, M. 1994. Improved non-approximability results. In Proceedings of 26th Annual ACM Symposium on Theory of Computation (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 184-193. Google ScholarDigital Library
- BEN-OR, M., GOLDWASSER, S., KILIAN, J., AND WIGDERSON, A. 1998. Multiprover interactive proofs: How to remove intractability. In Proceedings of the 20th Annual ACM Symposium on Theory of Computation (Chicago, Ill., May 2-4). ACM, New York, pp. 113-131. Google ScholarDigital Library
- BLUM, M., LUBY, M., AND RUBINFELD, R. 1993. Self-testing/ correcting with applications to numerical problems. J. Comput. Sys. Sci. 47, 549-595. Google ScholarDigital Library
- FEIGE, U. 1998. A threshold of ln n for approximating set cover. J. ACM, 45, 634-652. Google ScholarDigital Library
- FEIGE, U., AND GOEMANS, M. 1995. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the 3rd Israeli Symposium on the theory of Computing and Systems. IEEE Computer Society, Tel Aviv, Israel, pp. 182-189. Google ScholarDigital Library
- FEIGE, U., GOLDWASSER, S., LOVASZ L., SAFRA S., AND SZEGEDY, M. 1996. Interactive proofs and the hardness of approximating cliques. J. ACM, 43, 2 (Mar.), 268-292. Google ScholarDigital Library
- FEIGE, U., AND KILIAN, J. 1998. Zero-knowledge and the chromatic number. J. Comput. Syst. Sci. 57,2, 187-200. Google ScholarDigital Library
- FORTNOW, L., ROMPEL, J., AND SIPSER, M. 1994. On the power of multi-prover interactive protocols. Theoret. Comput. Sci. 134, 2, 545-557. Google ScholarDigital Library
- GAREY,M.R.,AND JOHNSON, D. S. 1979. Computers and Intractability. W. H. Freeman and Company, New York. Google ScholarDigital Library
- GOEMANS, M., AND WILLIAMSON, D. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6, 1115-1145. Google ScholarDigital Library
- GURUSWAMI, V., LEWIN, D., SUDAN, M., AND TREVISAN, L. 1998. A tight characterization of NP with 3 query PCPs. In Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science (Palo Alto, Calif.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 8-17. Google ScholarDigital Library
- HASTAD, J. 1999. Clique is hard to approximate within n1Acta Math. 182, 105-142.Google Scholar
- HOCHBAUM, D. 1983. Efficient algorithms for the stable set, vertex cover and set packing problems. Disc. Appl. Math. 6, 243-254.Google ScholarCross Ref
- JOHNSON, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci 9, 256-278.Google ScholarDigital Library
- JUDSON, T. 1994. Abstract Algebra, Theory and Applications. PWS Publishing Company, Boston, Mass.Google Scholar
- KANN, V., LAGERGREN, J., AND PANCONESI, A. 1996. Approximability of maximum splitting of k-sets and some other APX-complete problems. Inf. proc. lett. 58, 105-110. Google ScholarDigital Library
- LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. Algebraic methods for interactive proof systems. J. ACM 39, 2 (Apr.), 859-868. Google ScholarDigital Library
- PAPADIMITRIOU, C., AND YANNAKAKIS, M. 1991. Optimization, approximation and complexity classes. J. Comput. Syst. Sci. 43, pp. 425-440.Google ScholarCross Ref
- RAZ, R. 1998. A parallel repetition theorem. SIAM J. Comput, 27, 3, 763-803. Google ScholarDigital Library
- SHAMIR, A. 1992. IP D PSPACE. J. ACM 39, 2 (Apr.) 869-877. Google ScholarDigital Library
- TREVISAN, L., SORKIN, G., SUDAN, M., AND WILLIAMSON, D. 2000. Gadgets, approximation and linear programming. SIAM J. Comput. 29, 2074-2097. Google ScholarDigital Library
- ZWICK, U. 1998. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan). ACM, New York, pp. 201-210. Google ScholarDigital Library
Index Terms
- Some optimal inapproximability results
Recommendations
Approximation resistance from pairwise independent subgroups
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingWe show optimal (up to constant factor) NP-hardness for Max-k-CSP over any domain, whenever k is larger than the domain size. This follows from our main result concerning predicates over abelian groups. We show that a predicate is approximation ...
Reductions, codes, PCPs, and inapproximability
FOCS '95: Proceedings of the 36th Annual Symposium on Foundations of Computer ScienceMany recent results show the hardness of approximating NP-hard functions. We formalize, in a very simple way, what these results involve: a code-like Levin reduction. Assuming a well-known complexity assumption, we show that such reductions cannot prove ...
Inapproximability results for equations over infinite groups
An equation over a group G is an expression of form w"1...w"k=1"G, where each w"i is either a variable, an inverted variable, or a group constant and 1"G denotes the identity element; such an equation is satisfiable if there is a setting of the ...
Comments