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

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

doi:10.1007/978-3-540-24698-5_13

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

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 ∑ⁿ that the set's P-selector function declares to be most likely to belong to the set) is FP∑₂^p computable, and we show that each P-selective set contains a weakly-P∑₂ ^p-rankable subset.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Martin Farach-Colton
Publisher	Springer Verlag
Pages	90-99
Number of pages	10
ISBN (Print)	3540212582, 9783540212584
DOIs	https://doi.org/10.1007/978-3-540-24698-5_13
State	Published - 2004

Publication series

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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-24698-5_13

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

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Martin Farach-Colton. Springer Verlag, 2004. p. 90-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2976).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Hemaspaandra, LA, Ogihara, M, Zaki, MJ & 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). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2976, Springer Verlag, pp. 90-99. https://doi.org/10.1007/978-3-540-24698-5_13

Hemaspaandra LA, Ogihara M, Zaki MJ, Zimand M. The complexity of finding top-toda-equivalence-class members. In Farach-Colton M, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 90-99. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-24698-5_13

Hemaspaandra, Lane A. ; Ogihara, Mitsunori ; Zaki, Mohammed J. ; Zimand, Marius. / The complexity of finding top-toda-equivalence-class members. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Martin Farach-Colton. Springer Verlag, 2004. pp. 90-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{9649b955ef8c40bb940c74a8a9749540,

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∑2p 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",

doi = "10.1007/978-3-540-24698-5_13",

language = "English (US)",

isbn = "3540212582",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "90--99",

editor = "Martin Farach-Colton",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

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

Y1 - 2004

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∑2p 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∑2p 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

U2 - 10.1007/978-3-540-24698-5_13

DO - 10.1007/978-3-540-24698-5_13

M3 - Chapter

AN - SCOPUS:35048847017

SN - 3540212582

SN - 9783540212584

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

SP - 90

EP - 99

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

A2 - Farach-Colton, Martin

PB - Springer Verlag

ER -