Theory of Computing Systems

, Volume 38, Issue 1, pp 83–113 | Cite as

NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems

  • Sven Kosub


The boolean hierarchy of k-partitions over NP for k ≥ 3 was introduced as a generalization of the well-known boolean hierarchy of sets (2-partitions). The classes of this hierarchy are exactly those classes of NP-partitions which are generated by finite labeled lattices. We generalize the boolean hierarchy of NP-partitions by studying partition classes which are defined by finite labeled posets. We give an exhaustive answer to the question of which relativizable inclusions between partition classes can occur depending on the relation between their defining posets. This provides additional evidence for the validity of the Embedding Conjecture for lattices. The study of the generalized boolean hierarchy is closely related to the issue of whether one can reduce the number of solutions of NP problems. For finite cardinality types, assuming the generalized boolean hierarchy of k-partitions over NP is strict, we give a complete characterization when such solution reductions are possible. This resolves in some sense an open question by Hemaspaandra et al.


Computational Mathematic Complete Characterization Relativizable Inclusion Partition Class Solution Reduction 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science + Business Media Inc. 2004

Authors and Affiliations

  1. 1.Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching b. MünchenGermany

Personalised recommendations