Complements of multivalued functions

We study the class coNPMV of complements of NPMV functions. Though defined symmetrically to NPMV this class exhibits very different properties. We clarify the complexity of coNPMV by showing that it is essentially the same as that of NPMV/sup NP/ complete functions for coNPMV are exhibited and central complexity-theoretic properties of this class are studied. We show that computing maximum satisfying assignments can be done in coNPMV, which leads us to a comparison of NPMV and coNPMV with Krentel's classes Max P and Min P. The difference hierarchy for NPMV is related to the query hierarchy for coNPMV. Finally, we examine a functional analogue of Chang and Kadin's relationship between a collapse of the Boolean hierarchy over NP and a collapse of the polynomial time hierarchy.

[1]  Heribert Vollmer,et al.  The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..

[2]  戸田 誠之助,et al.  Computational complexity of counting complexity classes , 1991 .

[3]  Mark W. Krentel.  Generalizations of Opt P to the Polynomial Hierarchy , 1992, Theor. Comput. Sci..

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

[5]  Janakiramanan Ramachandran.  The Polynomial Time Function Hierarchy , 1994 .

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  Heribert Vollmer,et al.  Complexity Classes of Optimization Functions , 1995, Inf. Comput..

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

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

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

[11]  Christos H. Papadimitriou.  On the complexity of unique solutions , 1982, FOCS 1982.

[12]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[13]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[14]  Mitsunori Ogihara,et al.  Oracles that Compute Values , 1997, SIAM J. Comput..

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

[16]  Richard Chang,et al.  The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection , 1996, SIAM J. Comput..