The Boolean Hierarchy of NP-Partitions

Extended Abstract
  • Sven Kosub
  • Klaus W. Wagner
Conference paper

DOI: 10.1007/3-540-46541-3_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Kosub S., Wagner K.W. (2000) The Boolean Hierarchy of NP-Partitions. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

We introduce the boolean hierarchy of k-partitions over NP for k ≥ 3 as a generalization of the boolean hierarchy of sets (i.e., 2-partitions) over NP. Whereas the structure of the latter hierarchy is rather simple the structure of the boolean hierarchy of k-partitions over NP for k ≥ 3 turns out to be much more complicated. We establish the Embedding Conjecture which enables us to get a complete idea of this structure. This conjecture is supported by several partial results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Sven Kosub
    • 1
  • Klaus W. Wagner
    • 1
  1. 1.Theoretische InformatikJulius-Maximilians-Universität WürzburgWürzburgGermany

Personalised recommendations