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

Original languageEnglish
Pages (from-to)90-99
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2976
Publication statusPublished - 1 Dec 2004
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this