Reducibility classes of P-selective sets

Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara

Research output: Contribution to journalArticle

6 Citations (Scopus)

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

Fingerprint

Reducibility
Set theory
Polynomials
Polynomial-time Algorithm
Strings
Likely
Equivalence
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Reducibility classes of P-selective sets. / Hemaspaandra, Lane A.; Hoene, Albrecht; Ogihara, Mitsunori.

In: Theoretical Computer Science, Vol. 155, No. 2, 11.03.1996, p. 447-457.

Research output: Contribution to journalArticle

Hemaspaandra, Lane A. ; Hoene, Albrecht ; Ogihara, Mitsunori. / Reducibility classes of P-selective sets. In: Theoretical Computer Science. 1996 ; Vol. 155, No. 2. pp. 447-457.
@article{dc74a0735fba4eb993926f75a7d0446e,
title = "Reducibility classes of P-selective sets",
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.",
author = "Hemaspaandra, {Lane A.} and Albrecht Hoene and Mitsunori Ogihara",
year = "1996",
month = "3",
day = "11",
doi = "10.1016/0304-3975(96)00094-1",
language = "English (US)",
volume = "155",
pages = "447--457",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Reducibility classes of P-selective sets

AU - Hemaspaandra, Lane A.

AU - Hoene, Albrecht

AU - Ogihara, Mitsunori

PY - 1996/3/11

Y1 - 1996/3/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030107546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030107546&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(96)00094-1

DO - 10.1016/0304-3975(96)00094-1

M3 - Article

AN - SCOPUS:0030107546

VL - 155

SP - 447

EP - 457

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -