THE nonapproximability of non-boolean predicates

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 1, 2004, Pages 114-129

  Engebretsen, Lars ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation; Approximation hardness; Combinatorial optimization; Maximum CSP

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; HARMONIC ANALYSIS; LINEAR EQUATIONS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

APPROXIMATION HARDNESS; COMBINATORIAL OPTIMIZATION; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS (CSP); POLYNOMIAL TIME ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 14644432405     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100380458     Document Type: Article

References (22)

1. G. ANDERSSON, L. ENGEBRETSEN, AND J. HÅSTAD, A new way of using semidefinite programming with applications to linear equations mod p, J. Algorithms, 39 (2001), pp. 162-204.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
3. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability -towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
4. L. ENGEBRETSEN, The non-approximability of non-Boolean predicates, in Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 2129, M. Goemans, K. Jansen, J. D. P. Rolim, and L. Trevisan, eds., Springer-Verlag, Berlin, 2001, pp. 241-248.
5. L. ENGEBRETSEN AND V. GURUSWAMI, Is constraint satisfaction over two variables always easy?, Random Structures Algorithms, 25 (2004), pp. 150-178.
6. L. ENGEBRETSEN AND J. HOLMERIN, Three-query PCPs with perfect completeness over non-Boolean domains, in Proc. 18th IEEE Conference on Computational Complexity, Århus, 2003, pp. 284-299.
7. L. ENGEBRETSEN, J. HOLMERIN, AND A. RUSSELL, Inapproximability results for equations over finite groups, Theoret. Comput. Sci., 312 (2004), pp. 17-45.
8. U. FEIGE, A threshold ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
9. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
10. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
11. J. HÅSTAD AND A. WIGDERSON, Simple analysis of graph tests for linearity and PCP, Random Structures Algorithms, 22 (2003), pp. 139-160.
12. S. KHOT, Hardness results for approximate hypergraph coloring, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, QC, Canada, 2002, pp. 351-359.
13. S. KHOT, Hardness results for coloring 3-colorable 3-uniform hypergraphs, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002, pp. 23-32.
14. S. KHOT, On the power of unique 2-prover 1-round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, QC, Canada, 2002, pp. 767-775.
15. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
16. A. SAMORODNITSKY AND L. TREVISAN, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 191-199.
17. M. SERNA, L. TREVISAN, AND F. XHAFA, The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming, in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1373, M. Morvan, C. Meinel, and D. Krob, eds., Springer-Verlag, Berlin, 1998, pp. 488-498.
18. M. SUDAN AND L. TREVISAN, Probabilistically checkable proofs with low amortized query complexity, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, pp. 18-27.
19. A. TERRAS, Fourier Analysis on Finite Groups and Applications, London Math. Soc. Stud. Texts 43, Cambridge University Press, Cambridge, UK, 1999.
20. L. TREVISAN, Parallel approximation algorithms by positive linear programming, Algorithmica, 21 (1998), pp. 72-88.
21. L. TREVISAN, Recycling queries in PCPs and in linearity tests, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 299-308.
22. U. ZWICK, Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, ACM, New York, 1998, pp. 201-210.