Searching for "On Reductions of NP Sets to Sparse Sets." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

Bounded Truth-Table and Conjunctive Reductions to Sparse and Tally Sets
by Johannes Köbler, Ulmer Informatik-berichte, Vikraman Arvind, Vikraman Arvind, Johannes Kobler, Martin Mundhenk, Martin Mundhenk, Abteilung Fur Theoretische Informatik, Oberer Eselsberg — 1992
… nondeterministic polynomial time many-one reductions to sparse and co-sparse sets. We prove that if a coNP…
Cited by 4 (2 self) – Add To MetaCart

On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
by Vikraman Arvind Department, Vikraman Arvind, Johannes Kobler, Martin Mundhenk, Abteilung Fur Theoretische Informatik, Oberer Eselsberg — 1992 — In Proc. 12th Conference on the Foundations of Software Technology & Theoretical Computer Science
… sparse hard sets under polynomial time bounded truth-table reductions then P = NP. This has been, more…
Add To MetaCart

Reductions to Sets of Low Information Content
by V. Arvind — 1992
…(2/3):159-181, 1985. S. Homer and L. Longpr& On reductions of NP sets to sparse sets. In Proceedings of the 6th…
Cited by 23 (5 self) – Add To MetaCart

Showing 1 through 3.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB