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 ≥ 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.

[1]  Alan L. Selman,et al.  Qualitative Relativizations of Complexity Classes , 1985, J. Comput. Syst. Sci..

[2]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[3]  Alan L. Selman,et al.  A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[4]  Lane A. Hemaspaandra,et al.  Reducing the Number of Solutions of NP Functions , 2002, J. Comput. Syst. Sci..

[5]  Mitsunori Ogihara,et al.  On Using Oracles That Compute Values , 1993, STACS.

[6]  Alberto Bertoni,et al.  Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract) , 1989, FCT.

[7]  Jin-Yi Cai.  Probability One Separation of the Boolean Hierarchy , 1987, STACS.

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

[9]  Uwe Schning.  GRAPH ISOMORPHISM IS IN THE LOW HIERARCHY , 2022 .

[10]  Heribert Vollmer,et al.  The Chain Method to Separate Counting Classes , 1998, Theory of Computing Systems.

[11]  Heribert Vollmer.  Uniform characterizations of complexity classes , 1999, SIGA.

[12]  Birgit Jenner,et al.  The complexity of obtaining solutions for problems in NP , 1996 .

[13]  Vikraman Arvind,et al.  The counting complexity of group-definable languages , 2000, Theor. Comput. Sci..

[14]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

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

[16]  Sven Kosub.  On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems , 2000, MFCS.

[17]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

[18]  William M. Kantor,et al.  Computing in quotient groups , 1990, STOC '90.

[19]  Mitsunori Ogihara.  Functions Computable with Limited Access to NP , 1996, Inf. Process. Lett..

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

[21]  Lane A. Hemaspaandra,et al.  The Complexity Theory Companion , 2002, Texts in Theoretical Computer Science An EATCS Series.

[22]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

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

[24]  Heribert Vollmer,et al.  Uniform Characterizations of Complexity Classes of Functions , 2000, Int. J. Found. Comput. Sci..

[25]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[26]  Ashish V. Naik,et al.  A Hierarchy Based on Output Multiplicity , 1998, Theor. Comput. Sci..

[27]  Ulrich Hertrampf.  Classes of Bounded Counting Type and their Inclusion Relations , 1995, STACS.

[28]  Ulrich Hertrampf.  Complexity Classes with Finite Acceptance Types , 1993, STACS.

[29]  Alan L. Selman.  Much ado about functions , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[30]  Sven Kosub.  Boolean NP-Partitions and Projective Closure , 2003, DMTCS.

[31]  Pierluigi Crescenzi,et al.  A Uniform Approach to Define Complexity Classes , 1992, Theor. Comput. Sci..

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

[33]  Lance Fortnow,et al.  Inverting onto functions , 1995, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[34]  Manindra Agrawal,et al.  The Formula Isomorphism Problem , 2000, SIAM J. Comput..

[35]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[36]  Lane A. Hemaspaandra,et al.  Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1996, SIAM J. Comput..

[37]  Heribert Vollmer,et al.  Complements of multivalued functions , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[38]  Alan L. Selman.  A survey of one-way functions in complexity theory , 2005, Mathematical systems theory.

[39]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[40]  N. Vereshchagin.  RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS , 1994 .

[41]  Heribert Vollmer,et al.  On the power of number-theoretic operations with respect to counting , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.