On unapproximable versions of NP-complete problems

SIAM Journal on Computing

Volumn 25, Issue 6, 1996, Pages 1293-1304

  Zuckerman, David ^a  

^a University of Texas at Austin   (United States)

Author keywords

2SAT; Clique; Counting problems; N P complete; Permanent; Randomized reduction; Unapproximable

Indexed keywords

EID: 0001327627     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794266407     Document Type: Article

References (22)

1. M. AJTAI, J. KOMLOS, AND E. SZEMEREDI, Deterministic simulation in Logspace, in Proc. 19th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 132-140.
2. N. ALON, U. FEIGE, A. WIGDERSON, AND D. ZUCKERMAN, Derandomized graph products, Comput. Complexity, 5 (1995), pp. 60-75.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractibility of approximation problems, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
4. S. ARORA AND S. SAFRA, Approximating clique is N P-complete, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-13.
5. L. BASAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 16-25.
6. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proc. 25th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1993, pp. 294-304.
7. M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proc. 26th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1994, pp. 184-193.
8. P. BERMAN AND G. SCHNITGER, On the complexity of approximating the independent set problem, Inform. and Comput., 96 (1992), pp. 77-94.
9. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 14-19.
10. S. A. COOK, The complexity of theorem-proving procedures, in Proc. 3rd Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1971, pp. 151-158.
11. U. FEIGE, S. GOLDWASSER, L. LOVASZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost N P-complete, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 2-12.
12. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of N P-Completeness. W. H. Freeman, San Francisco, CA, 1979.
13. M. JERRUM AND U. VAZIRANI, A mildly exponential approximation algorithm for the permanent, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 320-326.
14. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
15. R. M. KARP, M. LUBY, AND N. MADRAS, Monte-Carlo approximation algorithms for enumeration problems, J. Algorithms, 10 (1989), pp. 429-448.
16. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, in Proc. 25th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1993, pp. 286-293.
17. A. PANCONESI AND D. RANJAN, Quantifiers and Approximation, in Proc. 22nd Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1990, pp. 446-456.
18. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
19. M. SANTHA, On using deterministic functions to reduce randomness in probabilistic algorithms, Inform. and Comput., 74 (1987), pp. 241-249.
20. M. SIPSER, Expanders, randomness, or time versus space, J. Comput. System Sci., 36 (1988), pp. 379-383.
21. L. G. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.
22. D. ZUCKERMAN, Simulating BPP using a general weak random source, Algorithmica, to appear; preliminary version in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 79-89.