𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On sparse sets in NP–P

✍ Scribed by Juris Hartmanis

Book ID
113162528
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
445 KB
Volume
16
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On reductions of NP sets to sparse sets
On reductions of NP sets to sparse sets
✍ Steven Homer; Luc Longpré 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Ogiwara and Watanabe showed that if SAT is bounded truth-table reducible to a sparse set, then P = NP. In this paper we simplify their proof, strengthen the result and use it to obtain several new results. Among the new results are the following: • Applications of the main theorem to log-truth-tabl

There are No Sparse NP w -Hard Sets
There are No Sparse NP w -Hard Sets
✍ Cucker, Felipe; Grigoriev, Dima 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 125 KB
On Sparse Complete Sets
On Sparse Complete Sets
✍ Gerd Wechsung 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

SETS by GERD WECHSUNG in Jena (G.D.R.)') 0. Iritroduet,ion and Resnlt,s The consequences of the existence of Theorem 1 ([3]). P = KP o There exists a &-complete sparse set d 7 ~ coNP. Theorem 2 ( [ 7 ] ) . P = N P e There exists a SL-complete sparse set in NP. B precursor of Theorem 2 is contained i

On Sets Cook-Reducible to Sparse Sets
On Sets Cook-Reducible to Sparse Sets
✍ Solovay, Robert M. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 694 KB