Add to ORKGA set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorithm that given any two strings decides which is ``more likely'' to be in the set. This paper establishes a strict hierarchy among the various reductions and equivalences to P-selective sets
The P-selective sets are those sets for which there is a polynomial-time algorithm that, given any t...
We study two properties of a complexity class —whether there exists a truthtable hard p-selective la...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
AbstractA set is P-selective (Selman, 1979) if there is a polynomial-time semidecision algorithm for...
A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorith...
AbstractSelf-reducible sets and some low sets, including p-selective sets, and weakly p-selective se...
We consider sets Turing reducible to p-selective sets under various resource bounds and restricted n...
We distinguish self-reducibility of a language L with the question of whether search reduces to deci...
AbstractWe distinguish self-reducibility of a languageLwith the question of whether search reduces t...
We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selec...
AbstractWe show that any p-selective and self-reducible set is in P. As the converse is also true, w...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
We introduce a generalization of Selman s P-selectivity that yields a more flexible notion of select...
We study the polynomial-time semi-rankable sets (P-sr), the ranking analog of the P-selective sets. ...
AbstractA partial information algorithm for a language A computes for m input words (x1,…,xm) a set ...
The P-selective sets are those sets for which there is a polynomial-time algorithm that, given any t...
We study two properties of a complexity class —whether there exists a truthtable hard p-selective la...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
AbstractA set is P-selective (Selman, 1979) if there is a polynomial-time semidecision algorithm for...
A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorith...
AbstractSelf-reducible sets and some low sets, including p-selective sets, and weakly p-selective se...
We consider sets Turing reducible to p-selective sets under various resource bounds and restricted n...
We distinguish self-reducibility of a language L with the question of whether search reduces to deci...
AbstractWe distinguish self-reducibility of a languageLwith the question of whether search reduces t...
We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selec...
AbstractWe show that any p-selective and self-reducible set is in P. As the converse is also true, w...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
We introduce a generalization of Selman s P-selectivity that yields a more flexible notion of select...
We study the polynomial-time semi-rankable sets (P-sr), the ranking analog of the P-selective sets. ...
AbstractA partial information algorithm for a language A computes for m input words (x1,…,xm) a set ...
The P-selective sets are those sets for which there is a polynomial-time algorithm that, given any t...
We study two properties of a complexity class —whether there exists a truthtable hard p-selective la...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...