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

Equivalence classes
Equivalence class
Strings
Selector
Likely
Subset

ASJC Scopus subject areas

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

Cite this

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

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2976, 01.12.2004, p. 90-99.

Research output: Contribution to journalArticle

@article{2749cdea092e402abf5d5ee3f133b3ff,
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∑2 p computable, and we show that each P-selective set contains a weakly-P∑2 p-rankable subset.",
author = "Hemaspaandra, {Lane A.} and Mitsunori Ogihara and Zaki, {Mohammed J.} and Marius Zimand",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "2976",
pages = "90--99",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 - 2004/12/1

Y1 - 2004/12/1

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

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

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

M3 - Article

AN - SCOPUS:35048847017

VL - 2976

SP - 90

EP - 99

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -