We identify two properties that for P-selective sets are effectively computable. Namely w
AbstractWe propose a general proof technique based on the Turing machine halting problem that allows...
] Ashish V. Naik Alan L. Selman y December 19, 1995 Abstract We study two properties of a compl...
AbstractIn this paper, complexity classes of functions defined via taking maxima or minima (cf. the ...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorith...
AbstractA set is P-selective (Selman, 1979) if there is a polynomial-time semidecision algorithm for...
A set is P-selective [Sel79] if there is a polynomial-time semi-decision algorithm for the set---an ...
We study the polynomial-time semi-rankable sets (P-sr), the ranking analog of the P-selective sets. ...
We study two properties of a complexity class —whether there exists a truthtable hard p-selective la...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
AbstractThis paper investigates how many queries to k-membership comparable sets are needed in order...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
The P-selective sets are those sets for which there is a polynomial-time algorithm that, given any t...
AbstractWe propose a general proof technique based on the Turing machine halting problem that allows...
] Ashish V. Naik Alan L. Selman y December 19, 1995 Abstract We study two properties of a compl...
AbstractIn this paper, complexity classes of functions defined via taking maxima or minima (cf. the ...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
We identify two properties that for P-selective sets are effectively computable. Namely we show that...
A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorith...
AbstractA set is P-selective (Selman, 1979) if there is a polynomial-time semidecision algorithm for...
A set is P-selective [Sel79] if there is a polynomial-time semi-decision algorithm for the set---an ...
We study the polynomial-time semi-rankable sets (P-sr), the ranking analog of the P-selective sets. ...
We study two properties of a complexity class —whether there exists a truthtable hard p-selective la...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
AbstractThis paper investigates how many queries to k-membership comparable sets are needed in order...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
The P-selective sets are those sets for which there is a polynomial-time algorithm that, given any t...
AbstractWe propose a general proof technique based on the Turing machine halting problem that allows...
] Ashish V. Naik Alan L. Selman y December 19, 1995 Abstract We study two properties of a compl...
AbstractIn this paper, complexity classes of functions defined via taking maxima or minima (cf. the ...
DOI
Add to ORKG