Advertisement

The boolean hierarchy: Hardware over NP

  • Jin-yi Cai
  • Lane Hemachandra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)

Abstract

In this paper, we study the complexity of sets formed by boolean operations (∪, ∩, and complementation) on NP sets. These are the sets accepted by trees of hardware with NP predictates as leaves, and together form the boolean hierarchy. We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and DP in a richer perspective. Throughout, we emphasize the structure of the boolean hierarchy and its relations with more common classes.

Keywords

Finite Union Complementary Classis Structural Asymmetry Polynomial Hierarchy Relativize World 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [BG81]
    C. Bennett and J. Gill, “Relative to a Random Oracle, PA ≠ NPA ≠ coNPA with Probability 1,” SIAM Journal on Computing, Vol. 10, #1, Feb. 1981, pp. 96–113.CrossRefGoogle Scholar
  2. [BG82]
    A. Blass and Y. Gurevich, “On the Unique Satisfiability Problem”, Information and Control, 55, 1982, pp. 80–88.CrossRefGoogle Scholar
  3. [BS79]
    T. Baker and A. Selman, “A Second Step Towards the Polynomial Hierarchy,” Theoretical Computer Science, 8, 1979, pp. 177–187.Google Scholar
  4. [CH85]
    Jin-yi Cai and Lane Hemachandra, “The Boolean Hierarchy: Hardware over NP,” Cornell Computer Science Department Technical Report TR85-724, December 1985.Google Scholar
  5. [C71]
    S.A. Cook, “The Complexity of Theorem-Proving Procedures,” Proceedings of the 3 rd Annual Symposium on the Theory of Computation, 1971, pp. 151–158.Google Scholar
  6. [CM85]
    J. Cai and G.E. Meyer, “Graph Minimal Uncolorability is DP-Complete,” Cornell Computer Science Department Technical Report TR85-688, June 1985.Google Scholar
  7. [FSS81]
    M. Furst, J.B. Saxe and M. Sipser, “Parity, Circuits, and the Polynomial-Time Hierarchy,” Proceedings of the 22 rd Annual Symposium on Foundations of Computer Science, 1981, pp. 260–270.Google Scholar
  8. [GJ79]
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979, Freeman.Google Scholar
  9. [H82]
    J. Hartmanis, “On the Structure of Feasible Computations,” Cornell Department of Computer Science Technical Report TR82-484, March 1982.Google Scholar
  10. [H84]
    H. Heller, “Relativized Polynomial Hierarchies Extending Two Levels,” Mathematical Systems Theory, V. 17, #2, May 1984, pp. 71–84.Google Scholar
  11. [HH86a]
    Juris Hartmanis and Lane Hemachandra, “On Sparse Oracles Separating Feasible Complexity Classes,” Proceedings of the 3 rd Annual Symposium on Theoretical Aspects of Computer Science (STACS '86), Lecture Notes in Computer Science #210, Springer-Verlag, 1986, pp. 321–333.Google Scholar
  12. [HH86b]
    Juris Hartmanis and Lane Hemachandra, “Complexity Classes Without Machines: On Complete Sets for UP,” to appear in Proceedings of the 13 th Colloquium on Automata, Languages and Programming (ICALP '86), Lecture Notes in Computer Science, Springer-Verlag, 1986.Google Scholar
  13. [HI85]
    J. Hartmanis and N. Immerman, “On Complete Problems for NP∩coNP,” Proceedings of the 12 th Colloquium on Automata, Languages and Programming (ICALP '85), Lecture Notes in Computer Science #194, Springer-Verlag, 1985.Google Scholar
  14. [HSI83a]
    J. Hartmanis, V. Sewelson, and N. Immerman, “Sparse Sets in NP-P: EXPTIME versus NEXPTIME,” Cornell Computer Science Department Technical Report TR83-544, February 1983.Google Scholar
  15. [HSI83b]
    J. Hartmanis, V. Sewelson, and N. Immerman, “Sparse Sets in NP-P: EXPTIME versus NEXPTIME,” Proceedings of the 15 th Annual Symposium on the Theory of Computation, 1983, pp. 382–391.Google Scholar
  16. [HY84]
    J. Hartmanis and Y. Yesha, “Computation Times of NP Sets of Different Densities,” Theoretical Computer Science, V. 34, 1984, pp. 17–32.CrossRefGoogle Scholar
  17. [KL80]
    R.M. Karp and R.J. Lipton, “Some Connections Between Nonuniform and Uniform Complexity Classes,” Proceedings of the 12 th Annual Symposium on the Theory of Computation, 1980, pp. 302–309.Google Scholar
  18. [M82]
    S. Mahaney, “Sparse Complete Sets for NP: Solution to a Conjecture of Berman and Hartmanis,” Journal of Computer and Systems Sci., 25, 1982, pp. 130–143.Google Scholar
  19. [PW85]
    C.H. Papadimitriou and D. Wolfe, “The Complexity of Facets Resolved,” Proceedings of the 26 th Annual Symposium on Foundations of Computer Science, 1985.Google Scholar
  20. [PY82]
    C.H. Papadimitriou and M. Yannakakis, “The Complexity of Facets (and Some Facets of Complexity),” Proceedings of the 14 th Annual Symposium on the Theory of Computation, 1982, pp. 255–260.Google Scholar
  21. [PZ82]
    C.H. Papadimitriou and S.K. Zachos, “Two Remarks on the Complexity of Counting,” MIT-LCS Technical Report MIT/LCS/TM-228, August 1982.Google Scholar
  22. [R85]
    D. A. Russo, “Structural Properties of Complexity Classes,” Thesis: University of California at Santa Barbara Department of Mathematics, March 1985.Google Scholar
  23. [S82]
    M. Sipser, “On Relativization and the Existence of Complete Sets,” Proceedings of the 9 th Colloquium on Automata, Languages and Programming (ICALP '82), Lecture Notes in Computer Science #140, Springer-Verlag, 1982, pp. 523–531.Google Scholar
  24. [SB84]
    U. Schoning and R.V. Book, “Immunity, Relativizations, and Nondeterminism,” SIAM Journal on Computing, Vol. 13, #2, May 1984, pp. 329–337.Google Scholar
  25. [W85]
    I. Wegner, “On the boolean closure of NP,” Proceedings of the 1985 International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science, Springer-Verlag, 1985, pp. 485–493.Google Scholar
  26. [Y83]
    Y. Yesha, “On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets,” SIAM Journal on Computing, Vol. 12, #3, August 1983, pp. 411–425.CrossRefGoogle Scholar
  27. [Y85]
    A. Yao, “Separating the Polynomial-Time Hierarchy by Oracles,” Proceedings of the 26 th Annual Symposium on Foundations of Computer Science, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jin-yi Cai
    • 1
  • Lane Hemachandra
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations