Searching for "On Membership Comparable Sets." – sorted by Relevance.
-
On Membership Comparable Sets
- On Membership Comparable Sets D. Sivakumar Abstract A set A is k(n) membership comparable
- Cited by 13 (1 self) – Add To MetaCart
-
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 the Reducibility of Sets Inside NP to Sets with Low Information Content
- are tally sets, sparse sets, P-selective sets and membership comparable sets. For the graph automorphism
- Cited by 2 (1 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
-
On the Structure of Low Sets
- Membership comparable sets Ogihara [Ogi94] has recently introduced the notion of membership comparable sets
- Cited by 8 (2 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
-
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
-
On Some Promise Classes in Structural Complexity Theory
- -time membership comparable sets" [Ogi94]. In Chapter 5, we introduce a generalization of P
- Cited by 2 (1 self) – Add To MetaCart
-
Semi-Membership Algorithms: Some Recent Advances
- defined generalizations of the P-selective sets (for example, the membership-comparable sets [Ogi94
- Cited by 14 (8 self) – Add To MetaCart
-
Randomness and Complexity
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 7.2 Resource Bounded Measure and Polynomial Time Membership Comparable Sets
- Add To MetaCart

