Quantitative relativizations of complexity classes
SIAM Journal on Computing
Sparse sets lowness and highness
SIAM Journal on Computing
On sets truth-table reducible to sparse sets
SIAM Journal on Computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Relating equivalence and reducibility to sparse sets
SIAM Journal on Computing
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
On symmetric differences of NP-hard sets with weakly P-selective sets
Theoretical Computer Science
Twenty questions to a p-selector
Information Processing Letters
Reductions to sets of low information content
Complexity theory
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
Computing Solutions Uniquely collapses the Polynomial Hierarchy
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Locating P/poly Optimally in the Extended Low Hierarchy
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Reducibility Classes of P-Selective Sets
Reducibility Classes of P-Selective Sets
On P-Selectivity and Closeness
On P-Selectivity and Closeness
Open questions in the theory of semifeasible computation
ACM SIGACT News
| Hi-index | 0.00 |
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.