Searching for "On Sparse Sets in NP - P." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
On the Existence of Hard Sparse Sets under Weak Reductions
- … with one-sided error, then P = Randomized LOGSPACE. (3) If there exists an NP-hard sparse set under…
- Cited by 18 (5 self) – Add To MetaCart
-
Limitations of the Upward Separation Technique
- … is the construction of an oracle relative to which there are extremely sparse sets in NP−P, but NEE = EE…
- Cited by 16 (0 self) – Add To MetaCart
-
How Reductions to Sparse Sets Collapse the Polynomial-time Hierarchy: A Primer
- … S for some sparse set S, then P = NP; a result which subsumed all earlier results on polynomial-time bounded…
- Cited by 14 (0 self) – Add To MetaCart
-
On P-selectivity and Closeness
- … dissertation that sparse sets cannot be p m -complete set for NP unless P = NP [24]. On the other hand…
- Cited by 3 (0 self) – Add To MetaCart
-
Reductions to Sets of Low Information Content
- …, and V. Sewelson. Sparse sets in NP-P: EXPTIME versus NEXPTIME. Information and Control, 65…
- Cited by 23 (5 self) – Add To MetaCart
-
Are Cook and Karp Ever the Same?
- ….3 (HIS) If E = NE then all sparse sets in NP are P-printable. Proof: Let A be a sparse set in NP…
- Cited by 2 (0 self) – Add To MetaCart
-
Are Cook and Karp Ever the Same?
- ….3 (HIS) If E = NE then all sparse sets in NP are P-printable. Proof: Let A be a sparse set in NP…
- Add To MetaCart
Showing 1 through 7.
