Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 430–435Cite as

Intersection suffices for Boolean hierarchy equivalence

  • Session 7B: Complexity Theory
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Abstract

It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any complexity class closed under intersection.

Work done in part while visiting the University of Amsterdam and the Friedrich-Schiller-Universität Jena. Supported in part by grants NSF-CCR-8957604, NSF-INT-9116781/JSPS-ENGR-207, and NSF-CCR-9322513, and by an NAS/NRC COBASE grant.

Work done in part while visiting the University of Rochester. Supported in part by a grant from the DAAD.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam, and P. Young. Generalized Boolean hierarchies and Boolean hierarchies over RP. In Proceedings of the 7th Conference on Fundamentals of Computation Theory, pages 35–46. Springer-Verlag Lecture Notes in Computer Science #380, August 1989.

    Google Scholar 

  2. R. Beigel, R. Chang, and M. Ogiwara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory, 26:293–310, 1993.

    Article  Google Scholar 

  3. A. Blass and Y. Gurevich. On the unique satisfiability problem. Information and Control, 55:80–88, 1982.

    Article  Google Scholar 

  4. R. Beigel and J. Goldsmith. Downward separation fails catastrophically for limited nondeterminism classes. In Proceedings of the 9th Structure in Complexity Theory Conference, pages 134–138. IEEE Computer Society Press, June/July 1994.

    Google Scholar 

  5. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The Boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6): 1232–1252, 1988.

    Article  Google Scholar 

  6. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The Boolean hierarchy II: Applications. SIAM Journal on Computing, 18(1):95–111, 1989.

    Article  Google Scholar 

  7. J. Cai and L. Hemachandra. The Boolean hierarchy: Hardware over NP. Technical Report 85-724, Cornell University, Department of Computer Science, Ithaca, NY, December 1985.

    Google Scholar 

  8. R. Chang. On the Structure of NP Computations under Boolean Operators. PhD thesis, Cornell University, Ithaca, NY, 1991.

    Google Scholar 

  9. R. Chang and J. Kadin. The Boolean hierarchy and the polynomial hierarchy: A closer connection. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 169–178. IEEE Computer Society Press, July 1990.

    Google Scholar 

  10. R. Chang and J. Kadin. On computing Boolean connectives of characteristic functions. Technical Report TR 90-1118, Department of Computer Science, Cornell University, Ithaca, NY, May 1990.

    Google Scholar 

  11. J. Cai and G. Meyer. Graph minimal uncolorability is DP-complete. SIAM Journal on Computing, 16(2):259–277, 1987.

    Article  Google Scholar 

  12. S. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing, pages 151–158, 1971.

    Google Scholar 

  13. F. Hausdorff. Grundzüge der Mengenlehre. Leipzig, 1914.

    Google Scholar 

  14. J. Hartmanis and L. Hemachandra. Complexity classes without machines: On complete languages for UP. Theoretical Computer Science, 58:129–142, 1988.

    Article  Google Scholar 

  15. L. Hemachandra and S. Jha. Defying upward and downward separation. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 185–195. Springer-Verlag Lecture Notes in Computer Science #665, February 1993.

    Google Scholar 

  16. L. Hemaspaandra, S. Jain, and N. Vereshchagin. Banishing robust Turing completeness. International Journal of Foundations of Computer Science, 4(3):245–265, 1993.

    Article  Google Scholar 

  17. L. Hemachandra and R. Rubinstein. Separating complexity classes with tally oracles. Theoretical Computer Science, 92(2):309–318, 1992.

    Article  Google Scholar 

  18. J. Kadin. The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263–1282, 1988. Erratum appears in the same journal, 20(2):404.

    Article  Google Scholar 

  19. J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. R.A.I.R.O. Informatique théorique et Applications, 21:419–435, 1987.

    Google Scholar 

  20. L. Levin. Universal sorting problems. Problems of Information Transmission, 9:265–266, 1973.

    Google Scholar 

  21. A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pages 125–129, 1972.

    Google Scholar 

  22. C. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28(2):244–259, 1984.

    Article  Google Scholar 

  23. K. Regan. Provable complexity properties and constructive reasoning. Manuscript, April 1989.

    Google Scholar 

  24. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.

    Article  Google Scholar 

  25. L. Valiant. The relative complexity of checking and evaluating. Information Processing Letters, 5:20–23, 1976.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, 14627, Rochester, NY, USA

    Lane A. Hemaspaandra

  2. Institut für Informatik, Friedrich-Schiller-Universität Jena, 07743, Jena, Germany

    Jörg Rothe

Authors
  1. Lane A. Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg Rothe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemaspaandra, L.A., Rothe, J. (1995). Intersection suffices for Boolean hierarchy equivalence. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030862

Download citation

  • DOI: https://doi.org/10.1007/BFb0030862

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation