Semi-membership algorithms: some recent advances

A semi-membership algorithm for a set A is, informally, a program that when given any two strings determines which is logically more likely to be in A. A flurry of interest in this topic in the late seventies and early eighties was followed by a relatively quiescent half-decade. However, in the 1990s there has been a resurgence of interest in this topic. We survey recent work on the theory of semi-membership algorithms.

[1]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[2]  H. Buhrman,et al.  Resource bounded reductions , 1993 .

[3]  José L. Balcázar,et al.  Sparse Sets, Lowness and Highness , 1986, SIAM J. Comput..

[4]  Osamu Watanabe,et al.  Relating equivalence and reducibility to sparse sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Johannes Köbler.  Locating P/poly Optimally in the Extended Low Hierarchy , 1993, STACS.

[6]  Peter van Emde Boas,et al.  Twenty Questions to a P-Selector , 1993, Inf. Process. Lett..

[7]  Mitsunori Ogihara,et al.  P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[8]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[10]  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).

[11]  Frank Stephan,et al.  Approximable Sets , 1995, Inf. Comput..

[12]  J. Kk.  Locating P poly Optimally in the Extended Low Hierarchy , 1993 .

[13]  Osamu Watanabe,et al.  Relating Equivalence and Reducibility to Sparse Sets , 1992, SIAM J. Comput..

[14]  Osamu Watanabe,et al.  How hard are sparse sets? , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[15]  Rajesh P. N. Rao.  On P-Selectivity and Closeness , 1994 .

[16]  Lane A. Hemaspaandra,et al.  Reductions to Sets of Low Information Content , 1992, Complexity Theory: Current Research.

[17]  Jie Wang,et al.  Selectivity and Self-reducibility: New Characterizations of Complexity Classes , 1994 .

[18]  Mitsunori Ogihara.  Polynomial-Time Membership Comparable Sets , 1995, SIAM J. Comput..

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

[20]  Osamu Watanabe,et al.  On polynomial time bounded truth-table reducibility of NP sets to sparse sets , 1990, STOC '90.

[21]  V. Rich.  Personal communication , 1989, Nature.

[22]  Osamu Watanabe,et al.  On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..

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

[24]  Paul Young.  How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions , 1992, SIGA.

[25]  Alan L. Selman,et al.  Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity , 1982, Inf. Control..

[26]  Vikraman Arvind,et al.  Polynomial time truth-table reductions to p-selective sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

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

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

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

[30]  Carl K. Chang,et al.  Proceedings of the Fifth International Conference on Computing and Information , 1993 .

[31]  Harry Buhrman,et al.  P-selective self-reducibles sets: a new characterization of P , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[32]  Lane A. Hemaspaandra,et al.  Reducibility Classes of P-Selective Sets , 1996, Theor. Comput. Sci..

[33]  Lane A. Hemaspaandra,et al.  P-Selectivity: Intersections and Indices , 1995, Theor. Comput. Sci..

[34]  Eric Allender,et al.  Lower bounds for the low hierarchy , 1992, JACM.

[35]  Bin Fu,et al.  On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets , 1993, Theor. Comput. Sci..

[36]  Ker-I Ko,et al.  On Sets Truth-Table Reducible to Sparse Sets , 1988, SIAM J. Comput..

[37]  F. R. Drake,et al.  Recursion Theory: its Generalisations and Applications , 1980 .