@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)",
}