Searching for "Polynomial-Time Membership Comparable Sets." – sorted by Relevance.
-
Polynomial-Time Membership Comparable Sets
- Polynomial-Time Membership Comparable Sets Mitsunori Ogihara 1 Department of Computer Science
- Cited by 27 (3 self) – Add To MetaCart
-
On Membership Comparable Sets
- polynomial-time membership comparable sets. A set A is k(n) membership comparable if there is a polynomial
- Cited by 13 (1 self) – Add To MetaCart
-
On Some Promise Classes in Structural Complexity Theory
- 's classes of polynomial-time membership comparable sets. Although SH is a strict hierarchy, we show
- Cited by 2 (1 self) – Add To MetaCart
-
NP-hard sets are superterse unless NP is small
- Measure and Polynomial Time Membership Comparable Sets We first introduce a fragment of Lutz's effective
- Cited by 5 (0 self) – Add To MetaCart
-
Polynomial-time multiselectivity
- sets" [BKS95]), Ogihara's \polynomial-time membership-comparable sets" [Ogi95], Cai and Hemaspaandra
- Cited by 1 (1 self) – Add To MetaCart
-
Boolean operations, joins, and the extended low hierarchy. Theoretical Computer Science
- -selective sets [Sel79], denoted P-Sel) such as the polynomial-time membership-comparable sets introduced
- Cited by 2 (2 self) – Add To MetaCart
-
Randomness and Complexity
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 7.2 Resource Bounded Measure and Polynomial Time Membership Comparable Sets
- Add To MetaCart
-
Reducibility Classes of P-selective Sets
- Mitsunori Ogihara x March 28, 1995 Abstract A set is P-selective [Sel79] if there is a polynomial-time
- Cited by 3 (2 self) – Add To MetaCart

