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.
Cite
CITATION STYLE
Kosub, S., & Wagner, K. W. (2000). The boolean hierarchy of NP-partitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1770, pp. 157–168). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
