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

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

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

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∑2p computable, and we show that each P-selective set contains a weakly-P∑2 p-rankable subset.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMartin Farach-Colton
PublisherSpringer Verlag
Pages90-99
Number of pages10
ISBN (Print)3540212582, 9783540212584
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2976
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

  • Cite this

    Hemaspaandra, L. A., Ogihara, M., Zaki, M. J., & Zimand, M. (2004). The complexity of finding top-toda-equivalence-class members. In M. Farach-Colton (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 90-99). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2976). Springer Verlag. https://doi.org/10.1007/978-3-540-24698-5_13