Polynomial-Time Semi-Rankable Sets (1995)

by Lane A. Hemaspaandra , Mohammed J. Zaki , Marius Zimand
Venue:Special Issue: Proceedings of the 8th International Conference on Computing and Information
Citations:3 - 3 self

Active Bibliography

Open Questions in the Theory of Semifeasible Computation ∗ – Piotr Faliszewski, Lane A. Hemaspa
7 The Complexity of Finding Top-Toda-Equivalence-Class Members – Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand - 2003
3 Selectivity: Reductions, Nondeterminism, and Function Classes – Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang - 1993
10 On the Structure of Low Sets – Johannes Köbler - 1995
4 Reducibility Classes of P-selective Sets – Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara - 1995
41 Computing Solutions Uniquely Collapses the Polynomial Hierarchy – Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman - 1993
3 On P-selectivity and Closeness – Rajesh P.N. Rao - 1994
10 Locating P/poly Optimally in the Extended Low Hierarchy – Johannes Köbler - 1993
31 Polynomial-Time Membership Comparable Sets – Mitsunori Ogihara - 1994