Bounded queries, approximations, and the Boolean Hierarchy

Information and Computation

Volumn 169, Issue 2, 2001, Pages 129-159

  Chang, Richard ^a  

^a University of Marylandw Baltimore County   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

BOOLEAN HIERARCHY;

QUERY LANGUAGES;

EID: 0035885988     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2884     Document Type: Article

References (42)

1. [ABG90] Amir, A., Beigel, R., and Gasarch, W. I. (1990), Some connections between bounded query classes and non-uniform complexity, in "Proceedings of the 5th Structure in Complexity Theory Conference," pp. 232-243.
2. [AFWZ95] Alon, N., Feige, U., Wigderson, A., and Zuckerman, D. (1995), Derandomized graph products. Comput. Complexity 5, 60-75.
3. [ALMZ92] Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp. 14-23.
4. [Aro94] Arora, S. (1994), "Probabilistic Checking, of Proofs and Hardness of Approximation Problems," Ph.D. thesis, University of California Berkeley; revised version available as Technical Report CS-TR-476-94.
5. [Aro96] Arora, S. (1996), Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in "Proceedings of the IEEE Symposium on Foundations of Computer Science." pp. 2-11.
6. [Aro97] Arora, S. (1997), Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp. 554-563.
7. [AS92] Arora, S., and Safra, S. (1992), Probabilistic checking of proofs, in "Proceedings of the IEEE Symposium on Foundations of Computer Science." pp. 2-13.
8. [BC97] Beigel, R., and Chang, R. (1997), Commutative queries, in "Proceedings of the 5th Israel Symposium on Theory of Computing and Systems." pp. 159-165. IEEE Comput. Sci. Press. Los Alamitos, CA.
9. [BCO93] Beigel, R., Chang, R., and Ogiwara, M. (1993), A relationship between difference hierarchies and relativized polynomial hierarchies, Math. Systems Theory 26(3), 293-310.
10. [BDG90] Balcázar, J. L., Díaz, J., and Gabarró, J. (1990), "Structural Complexity 11," EATCS Monographs on Theoretical Computer Science. Vol. 22, Springer-Verlag, Berlin/New York.
11. [Bei91] Beigel, R. (1991), Bounded queries to SAT and the Boolean hierarchy, Theoret. Comput. Sci. 84(2), 199-223.
12. [BF98] Buhrman, H., and Fortnow, L. (1998), Two queries, in "Proceedings of the 13th Annual IEEE Conference on Computational Complexity," pp, 13-19.
13. [BLS84] Book, R. V., Long, T. J., and Selman, A. L. (1984), Quantitative relativizations of complexity classes, SIAM J. Comput. 13, 461-487.
14. [Cai87] Cai, J. (1987), Probability one separation of the Boolean hierarchy, in "4th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science. Vol. 247. pp. 148-158. Springer-Verlag, Berlin/New York.
15. [CG93] Chang, R., and Gasarch, W. I. (1993), On bounded queries and approximation, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp, 547-556.
16. [CGH+88] Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagnner, K., and Wechsung, G. (1988), The Boolean hierarchy. I. Structural properties, SIAM J. Comput. 17(6), 1232-1252.
17. [CGH+89] Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., and Wechsung, G. (1989), The Boolean hierarchy. II. Applications, SIAM J. Comput. 18(1), 95-111.
18. [CGL97] Chang, R., Gasarch, W. I., and Lund, C. (1997), On bounded queries and approximation, SIAM J. Comput. 26(1), 188-209.
19. [Cha94] Chang, R. (1994), Structural complexity column: A machine model for NP-approximation problems and the revenge of the Boolean hierarchy, Bull. Euro. Assoc. Theoret. Comput. Sci. 54, 166-182.
20. [Cha96] Chang, R. (1996), On the query complexity of clique size and maximum satisfiability, J. Comput System Sci. 53, 298-313.
21. [CK95] Chang, R., and Kadin, J. (1995), On computing Boolean connectives of characteristic functions, Math. Systems Theory 28(3), 173-198.
22. [CK96] Chang, R., and Kadin, J. (1996), The Boolean hierarchy and the polynomial hierarchy: A closer connection, SIAM J. Comput. 25(2), 340-354.
23. [CKST95] Crescenzi, P., Kann, V., Silvestri, R., and Trevisan, L. (1995), Structure in approximation classes, in "Proceedings of the 1st Computing and Combinatorics Conference," Lecture Notes in Computer Science, Vol. 959. pp. 539-548, Springer-Verlag, Berlin/New York.
24. [CT94] Crescenzi, P., and Trevisan, L. (1994), On approximation scheme preserving reducibility and its applications, in "Proceedings of the 14th Conference on the Foundations of Software Technology and Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 880, pp. 330-341, Springer-Verlag, Berlin/New York.
25. [CW] Cohen, A., and Wigderson, A. (1989), Dispersers, deterministic amplification, and weak random sources, This paper is a full version of[CW89]. Available on-line at http://www.cs.huji.ac.il/̃avi/.
26. [CW89] Cohen, A., and Wigderson, A. (1989), Dispersers, deterministic amplification, and weak random sources, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp. 14-19.
27. +91] Feige, U., Goldwasscr, S., Lovász, L., Safra, S., and Szegedy, M. (1991), Approximating clique is almost NP-complete, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp. 2-12.
28. [Hem89] Hemachandra, L. (1989), The strong exponential hierarchy collapses, J. Comput. System Sci. 39, 299-322.
29. [HHH96] Hemaspaandra, E., Hemaspaandra, L. A., and Hempel, H. (1996), "Downward Translation in the Polynomial Hierarchy," Technical Report TR-630, Department of Computer Science; also in "Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science. Springer-Verlag, Berlin/New York.
30. [HHH96] Hemaspaandra, E., Hemaspaandra, L. A., and Hempel, H. (1996), "Downward Translation in the Polynomial Hierarchy," Technical Report TR-630, Department of Computer Science; also in "Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science. Springer-Verlag, Berlin/New York.
31. [Kad88] Kadin, J. (1988), The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SIAM J. Comput. 17(6), 1263-1282.
32. [KMSV94] Khanna, S., Motwani, R., Sudan, M., and Vazirani, U. (1994), On syntactic versus computational views of approximability, in "Proceedings of the IEEE Symposium on Foundations of Computer Science," pp. 819-830.
33. [Kre88] Krentel, M. W. (1988), The complexity of optimization problems, J. Comput. System Sci. 36, 490-509.
34. [KT94] Köbler, J., and Thierauf, T. (1994), Complexity-restricted advice functions, SIAM J. Comput. 23(2), 261-275.
35. [Lon85] Long, T. J. (1985), On restricting the size of oracles compared with restricting access to oracles, SIAM J. Comput. 14, 585-597.
36. [Lov75] Lovász, L. (1975), On the ratio of optimal integral and fractional covers, Discrete Math. 13, 383-390.
37. [Mit96] Mitchell, J. S. B. (1996), Guillotine subdivisions approximate polygonal subdivisions. II. A simple polynomial-time approximation scheme for geometric TSP, κ-MST, and related problems, SIAM J. Comput., to appear.
38. [Pap94] Papadimitriou, C. H. (1994), "Computational Complexity," Addison-Wesley, Reading, MA.
39. [PY84] Papadimitriou, C., and Yannakakis, M. (1984), The complexity of facets (and some facets of complexity), J. Comput. System Sci. 28, 244-259.
40. [Wag88] Wagner, K. (1988), Bounded query computations, in "Proceedings of the 3rd Structure in Complexity Theory Conference," pp. 260-277.
41. [Wag90] Wagner, K. (1990), Bounded query classes, SIAM J. Comput. 19, 833-846.
42. [Yap83] Yap, C. (1983), Some consequences of non-uniform conditions on uniform classes, Theor. Comput. Sci. 26(3), 287-300.