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
Pages (from-to)669-684
Number of pages16
JournalTheory of Computing Systems
Volume39
Issue number5
DOIs
Publication statusPublished - 1 Sep 2006
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

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

Cite this

Hemaspaandra, L. A., Ogihara, M., Zaki, M. J., & Zimand, M. (2006). The complexity of finding top-toda-equivalence-class members. Theory of Computing Systems, 39(5), 669-684. https://doi.org/10.1007/s00224-005-1211-9