论文信息 - The Boolean Hierarchy of NP-Partitions

The Boolean Hierarchy of NP-Partitions

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.

Klaus W. Wagner | Sven Kosub

[1] Gerd Wechsung,et al. On the Boolean closure of NP , 1985, FCT.

[2] Jie Wang,et al. Nondeterministically Selective Sets , 1995, Int. J. Found. Comput. Sci..

[3] G. Grätzer. General Lattice Theory , 1978 .

[4] Juris Hartmanis,et al. The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[5] Klaus W. Wagner,et al. The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[6] Jim Kadin. The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..

[7] Ulrich Hertrampf. Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.

[8] Jin-Yi Cai,et al. The Boolean Hierarchy: Hardware over NP , 1986, SCT.