Advertisement

Boolean NP-Partitions and Projective Closure

  • Sven Kosub
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2731)

Abstract

When studying complexity classes of partitions we often face the situation that different partition classes have the same component classes. The projective closures are the largest classes among these with respect to set inclusion. In this paper we investigate projective closures of classes of boolean NP-partitions, i.e., partitions with components that have complexity upper-bounds in the boolean hierarchy over NP. We prove that the projective closures of these classes are represented by finite labeled posets. We give algorithms for calculating these posets and related problems. As a consequence we obtain representations of the set classes NP(m) ∩ coNP(m) by means of finite labeled posets.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-Y. Cai, T. Gundermann, J. Hartmanis, L.A. Hemachandra, V. Sewelson, K.W. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232–1252, 1988.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    J.-Y. Cai and L. A. Hemachandra. The Boolean hierarchy: Hardware over NP. In Proceedings 1st Structure in Complexity Theory Conference, volume 223 of Lecture Notes in Computer Science, pages 105–124. Springer-Verlag, Berlin, 1986.Google Scholar
  3. 3.
    G. Grätzer. General Lattice Theory. Akademie-Verlag, Berlin, 1978.Google Scholar
  4. 4.
    L. A. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2002.MATHGoogle Scholar
  5. 5.
    J. Köbler, U. Schöning, and K.W. Wagner. The difference and truth-table hierarchies for NP. RAIRO Theoretical Informatics and Applications, 21(4):419–435, 1987.MATHGoogle Scholar
  6. 6.
    S. Kosub. On NP-partitions over posets with an application of reducing the set of solutions of NP problems. In Proceedings 25th Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 467–476. Springer-Verlag, Berlin, 2000.Google Scholar
  7. 7.
    S. Kosub and K.W. Wagner. The boolean hierarchy of NP-partitions. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 157–168. Springer-Verlag, Berlin, 2000. Expanded version available as Technical Report TUM-I0209, Technische Universität München, Institut für Informatik, September 2002.Google Scholar
  8. 8.
    K.W. Wagner and G. Wechsung. On the boolean closure of NP. Extended abstract as: G. Wechsung. On the boolean closure of NP. Proceedings 5th International Conference on Fundamentals in Computation Theory, volume 199 of Lecture Notes in Computer Science, pages 485–493, Berlin, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sven Kosub
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenGarching bei MünchenGermany

Personalised recommendations