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