Much ado about functions

This paper surveys basic results on complexity classes of partial multivalued functions. We stress basic inclusion relations, interesting hierarchies, and results that demonstrate that hierarchies are extant.

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

[2]  Ashish V. Naik,et al.  A note on p-selective sets and on adaptive versus nonadaptive queries to NP , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

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

[4]  Harry Buhrman,et al.  On functions computable with nonadaptive queries to NP , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

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

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

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

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

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

[10]  Jacobo Torán,et al.  Computing Functions with Parallel Queries to NP , 1995, Theor. Comput. Sci..

[11]  H. Wareham.  On the computational complexity of inferring evolutionary trees , 1992 .

[12]  Ronald V. Book,et al.  Positive Relativizations of Complexity Classes , 1983, SIAM J. Comput..

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

[14]  Russell Impagliazzo,et al.  The Relative Complexity of NP Search Problems , 1998, J. Comput. Syst. Sci..

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

[16]  Lane A. Hemaspaandra,et al.  Probabilistic Polynomial Time is Closed under Parity Reductions , 1991, Inf. Process. Lett..

[17]  Russell Impagliazzo,et al.  Decision versus search problems in super-polynomial time , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[19]  Ashish V. Naik.  The structural complexity of intractable search functions , 1995 .

[20]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[21]  R. Beigel.  NP-hard Sets are P-Superterse Unless R = NP , 1988 .

[22]  L. Hemachandra.  The strong exponential hierarchy collapses , 1987, STOC 1987.

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

[24]  Sarah Mocas.  Separating exponential time classes from polynomial time classes , 1993 .

[25]  Luc Longpré,et al.  Hard Promise Problems and Nonuniform Complexity , 1993, Theor. Comput. Sci..

[26]  Alan L. Selman,et al.  Polynomial Time Enumeration Reducibility , 1978, SIAM J. Comput..

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

[28]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

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

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

[31]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[32]  Ronald V. Book.  On Collapsing the Polynomial-Time Hierarchy , 1994, Inf. Process. Lett..

[33]  M.R. Fellows,et al.  Self-witnessing polynomial-time complexity and prime factorization , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[35]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

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

[37]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[38]  Zhi-Zhong Chen,et al.  On the Complexity of Computing Optimal Solutions , 1990, Int. J. Found. Comput. Sci..

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

[40]  Carme Àlvarez,et al.  A Very Hard log-Space Counting Class , 1993, Theor. Comput. Sci..

[41]  Alan L. Selman,et al.  P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP , 1979, ICALP.

[42]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[43]  Harry Buhrman,et al.  The Complexity of Generating and Checking Proffs of Membership , 1996, STACS.

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

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

[46]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[47]  Richard J. Lipton,et al.  Communication Complexity of Key Agreement on Limited Ranges , 1994 .