On bounded queries and approximation

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 188-209

  Chang, Richard ^a   Gasarch, William I ^b   Lund, Carsten ^c  

^a University of Marylandw Baltimore County   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Approximation algorithm; Bounded queries; Chromatic number; Maximum clique; NP completeness; Set cover

Indexed keywords

EID: 0013446876     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794266481     Document Type: Article

References (35)

1. A. AMIR, R. BEIGEL, AND W. I. GASARCH, Some connections between bounded query classes and non-uniform complexity, to Proc. 5th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 232-243.
2. A. AMIR AND W. I. GASARCH, Polynomial terse sets, Inform. and Comput., 77 (1988), pp. 37-56.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
4. S. ARORA AND S. SAFRA, Probabilistic checking of proofs, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-13.
5. L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
6. R. BEIGEL, A structural theorem thay depends quatitatively on the complexity of SAT, in Proc. 2nd Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 28-32.
7. R. BEIGEL, Bounded queries to SAT and the Boolean hierarchy, Theoret. Comput. Sci., 84 (1991), pp. 199-223.
8. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximations, in Proc. ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 294-304.
9. M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proc. ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 184-193.
10. R. B. BOPPANA AND M. M. HALLDÓRSSON, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), pp. 180-196.
11. R. CHANG, On the query complexity of clique size and maximum satisfiability, in Proc. 9th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 31-12; J. Comput. System Sci., to appear.
12. R. CHANG, On the query complexity of clique size and maximum satisfiability, in Proc. 9th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 31-12; J. Comput. System Sci., to appear.
13. R. CHANG, Structural complexity column: A machine model for NP-approximation problems and the revenge of the Boolean hierarchy, Bull. European Assoc. Theoret. Comput. Sci., 54 (1994), pp. 166-182.
14. R. CHANG AND J. KADIN, The Boolean hierarchy and the polynomial hierarchy: A closer connection, SIAM J. Comput., 25 (1996), pp. 340-354.
15. R. CHANG, J. KADIN, AND P. ROHATGI, On unique satisfiability and the threshold behavior of randomized reductions, J. Comput. System Sci., 50 (1995), pp. 359-373.
16. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 14-19.
17. P. CRESCENZI, V. KANN, R. SILVESTRI, AND L. TREVISAN, Structure in approximation classes, in Proc. 1st Computing and Combinatorics Conference, Lecture Notes in Comput. Sci. 959, Springer-Verlag, Berlin, 1996, pp. 530-548.
18. P. CRESCENZI AND L. TREVISAN, On approximation scheme preserving reducibility and its applications, in Proc. 14th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 880, Springer-Verlag, Berlin, 1994, pp. 330-341.
19. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP-complete, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 2-12.
20. M. R. GAREY AND D. S. JOHNSON, Computers and Interactability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
21. W. GASARCH, M. W. KRENTEL, AND K. RAPPOPORT, OptP-completeness as the normal behavior of NP-complete problems, Math. Systems Theory, 28 (1996), pp. 487-514.
22. A. HOENE AND A. NICKELSEN, Counting, selecting, sorting by query-bounded machines, in Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 665, Springer-Verlag Berlin, 1993, pp. 196-205.
23. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
24. J. KADIN, The polynomial time hierarchy collapse if the Boolean hierarchy collapses, SIAM J. Comput. 17 (1988), pp. 1263-1282.
25. M. W. KRENTEL, The complexity of optimization problems, J. Comput. System Sci., 36 (1988), pp. 490-509.
26. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
27. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 2-10.
28. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), pp. 960-981.
29. P. ROHATGI, Saving queries with randomness, J. Comput. System Sci., 50 (1995), pp. 476-492.
30. A. SHAMIR, IP = PSPACE, in Proc. IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 11-15.
31. H. U. SIMON, On approximate solutions for combinatorial optimization problems, SIAM J. Discrete Math., 3 (1990), pp. 294-310.
32. M. SIPSER, Expanders, randomness, or time versus space, in Structure in Complexity Theory, Lecture Notes in Comput. Sci. 223, Springer-Verlag, Berlin, 1986, pp. 325-329.
33. K. WAGNER, More complicated questions about maxima and minima and some closures of NP, in Proc. 13th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 226, Springer-Verlag, Berlin, 1986, pp. 434-443.
34. K. WAGNER AND G. WECHSUNG, On the Boolean closure of NP, in Proc. 1985 International Conference on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 199, Springer-Verlag, Berlin, 1985, pp. 485-493.
35. D. ZUCKERMAN, NP-complete problems have a version that's hard to approximate, in Proc. 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 305-312.