The complexity of finding top-toda-equivalence-class members

Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We identify two properties that for P-selective sets are effectively computable. Namely, we show that, for any P-selective set, finding a string that is in a given length's top Toda equivalence class (very informally put, a string from Σn that the set's P-selector function declares to be most likely to belong to the set) is FPΣp 2 computable, and we show that each P-selective set contains a weakly-P-Σprankable subset.

Original languageEnglish (US)
Pages (from-to)669-684
Number of pages16
JournalTheory of Computing Systems
Volume39
Issue number5
DOIs
StatePublished - Sep 2006
Externally publishedYes

Fingerprint

Equivalence classes
Equivalence class
Strings
Selector
Likely
Subset

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Mathematics(all)

Cite this

The complexity of finding top-toda-equivalence-class members. / Hemaspaandra, Lane A.; Ogihara, Mitsunori; Zaki, Mohammed J.; Zimand, Marius.

In: Theory of Computing Systems, Vol. 39, No. 5, 09.2006, p. 669-684.

Research output: Contribution to journalArticle

Hemaspaandra, Lane A. ; Ogihara, Mitsunori ; Zaki, Mohammed J. ; Zimand, Marius. / The complexity of finding top-toda-equivalence-class members. In: Theory of Computing Systems. 2006 ; Vol. 39, No. 5. pp. 669-684.
@article{bc741f340aff42d6ab5ccb24bccd2e32,
title = "The complexity of finding top-toda-equivalence-class members",
abstract = "We identify two properties that for P-selective sets are effectively computable. Namely, we show that, for any P-selective set, finding a string that is in a given length's top Toda equivalence class (very informally put, a string from Σn that the set's P-selector function declares to be most likely to belong to the set) is FPΣp 2 computable, and we show that each P-selective set contains a weakly-P-Σprankable subset.",
author = "Hemaspaandra, {Lane A.} and Mitsunori Ogihara and Zaki, {Mohammed J.} and Marius Zimand",
year = "2006",
month = "9",
doi = "10.1007/s00224-005-1211-9",
language = "English (US)",
volume = "39",
pages = "669--684",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "5",

}

TY - JOUR

T1 - The complexity of finding top-toda-equivalence-class members

AU - Hemaspaandra, Lane A.

AU - Ogihara, Mitsunori

AU - Zaki, Mohammed J.

AU - Zimand, Marius

PY - 2006/9

Y1 - 2006/9

N2 - We identify two properties that for P-selective sets are effectively computable. Namely, we show that, for any P-selective set, finding a string that is in a given length's top Toda equivalence class (very informally put, a string from Σn that the set's P-selector function declares to be most likely to belong to the set) is FPΣp 2 computable, and we show that each P-selective set contains a weakly-P-Σprankable subset.

AB - We identify two properties that for P-selective sets are effectively computable. Namely, we show that, for any P-selective set, finding a string that is in a given length's top Toda equivalence class (very informally put, a string from Σn that the set's P-selector function declares to be most likely to belong to the set) is FPΣp 2 computable, and we show that each P-selective set contains a weakly-P-Σprankable subset.

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

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

U2 - 10.1007/s00224-005-1211-9

DO - 10.1007/s00224-005-1211-9

M3 - Article

AN - SCOPUS:33748574291

VL - 39

SP - 669

EP - 684

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 5

ER -