Reducibility classes of P-selective sets

Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara

Research output: Contribution to journalArticle

6 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)447-457
Number of pages11
JournalTheoretical Computer Science
Volume155
Issue number2
DOIs
StatePublished - Mar 11 1996
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Reducibility classes of P-selective sets'. Together they form a unique fingerprint.

  • Cite this