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

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

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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Σp2 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
Issue number5
StatePublished - Sep 2006
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'The complexity of finding top-toda-equivalence-class members'. Together they form a unique fingerprint.

Cite this