Abstract
A set is P-selective (Selman, 1979) if there is a polynomial-time semidecision 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
