The Complexity of Finding Top-Toda-Equivalence-Class Members

Authors:
Lane A. Hemaspaandra;Mitsunori Ogihara;Mohammed J. Zaki;Marius Zimand
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY 14627, USA;Department of Computer Science, University of Rochester, Rochester, NY 14627, USA;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA;Department of Computer and Information Sciences, Towson University, Towson, MD 21252, USA
Venue:
Theory of Computing Systems
Year:
2006

Citing 0
Cited 4

Open questions in the theory of semifeasible computation

ACM SIGACT News
On the complexity of kings

Theoretical Computer Science
P-Selectivity, immunity, and the power of one bit

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
On the complexity of kings

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

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 $\Sigma^n$ that the set's P-selector function declares to be most likely to belong to the set) is ${\rm FP}^{\Sigma^p_2}$ computable, and we show that each P-selective set contains a weakly- $P^{\Sigma^p_2}$-rankable subset.