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

## Abstract

The boolean hierarchy of *k*-partitions over NP for *k* ≥ 2 was introduced as a generalization of the well-known boolean hierarchy of sets. The classes of this hierarchy are exactly those classes of NP-partitions which are generated by finite labeled lattices. We refine the boolean hierarchy of NP-partitions by considering partition classes which are generated by finite labeled posets. Since we cannot prove it absolutely, we collect evidence for this refined boolean hierarchy to be strict. We give an exhaustive answer to the question which relativizable inclusions between partition classes can occur depending on the relation between their defining posets. The study of the refined 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 extended boolean hierarchy of *k*-partitions over NP is strict, we get a complete characterization when such solution reductions are possible.

## Keywords

Multivalued Function Partial Function Partition Class Solution Reduction Exhaustive Answer## Preview

Unable to display preview. Download preview PDF.

## References

- 1.R. V. Book, T. J. Long, and A. L. Selman. Quantitative relativizations of complexity classes.
*SIAM Journal on Computing*, 13:461–487, 1984.zbMATHCrossRefMathSciNetGoogle Scholar - 2.R. V. Book, T. J. Long, and A. L. Selman. Qualitative relativizations of complexity classes.
*Journal of Computer and System Sciences*, 30(3):395–413, 1985.zbMATHCrossRefMathSciNetGoogle Scholar - 3.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.zbMATHCrossRefMathSciNetGoogle Scholar - 4.J.-Y. Cai and L. 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, 1986.Google Scholar - 5.G. Grätzer.
*General Lattice Theory*. Akademie-Verlag, Berlin, 1978.Google Scholar - 6.L. A. Hemaspaandra, A. V. Naik, M. Ogihara, and A. L. Selman. Computing solutions uniquely collapses the polynomial hierarchy.
*SIAM Journal on Computing*, 25(4):697–708, 1996.zbMATHCrossRefMathSciNetGoogle Scholar - 7.L. A. Hemaspaandra, M. Ogihara, and G. Wechsung. Reducing the number of solutions of NP functions. In
*Proceedings 25th Symposium on Mathematical Foundations of Computer Science*. These Proceedings.Google Scholar - 8.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.zbMATHGoogle Scholar - 9.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, Berlin, 2000. Springer-Verlag.Google Scholar - 10.A. V. Naik, J. D. Rogers, J. S. Royer, and A. L. Selman. A hierarchy based on output multiplicity.
*Theoretical Computer Science*, 207(1):131–157, 1998.zbMATHCrossRefMathSciNetGoogle Scholar - 11.M. Ogihara. Functions computable with limited access to NP.
*Information Processing Letters*, 58(1):35–38, 1996.zbMATHCrossRefMathSciNetGoogle Scholar - 12.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