Universitt at Ulm Fakultt at F Ur Informatik Bounded Truth-table and Conjunctive Reductions to Sparse and Tally Sets Universitt at Ulm Bounded Truth-table and Conjunctive Reductions to Sparse and Tally Sets
نویسندگان
چکیده
In this paper we study the consequences of the existence of sparse hard sets for diierent complexity classes under certain types of deterministic, randomized and nondeterministic reductions. We show that if an NP-complete set is bounded-truth-table reducible to a set that conjunctively reduces to a sparse set then P = NP. Relatedly, we show that if an NP-complete set is bounded-truth-table reducible to a set that co-rp reduces to some set that conjunctively reduces to a sparse set then RP = NP. We also prove similar results under the (apparently) weaker assumption that some solution of the promise problem (1SAT; SAT) reduces via the mentioned reductions to a sparse set. Finally we consider nondeterministic polynomial time many-one reductions to sparse and co-sparse sets. We prove that if a coNP-complete set reduces via a nondeterministic polynomial time many-one reduction to a co-sparse set then PH = p 2. On the other hand, we show that nonde-terministic polynomial time many-one reductions to sparse sets are as powerful as nondeterministic Turing reductions to sparse sets.
منابع مشابه
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic randomized and nondeterministic reductions We show that if an NP complete set is bounded truth table reducible to some set that conjunctively reduces to a sparse set then P NP This result subsumes and extends previously known results yielding a co...
متن کاملLowness and the Complexity of Sparse and Tally Descriptions
We investigate the complexity of obtaining sparse descriptions for sets in var ious reduction classes to sparse sets Let A be a set in a certain reduction class Rr SPARSE Then we are interested in nding upper bounds for the complexity relative to A of sparse sets S such that A Rr S By establishing such upper bounds we are able to derive the lowness of A In particular we show that if a set A is ...
متن کاملDeterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC, the collapse goes down to P=NC. We parameterize this result and obtain a generic theorem allowing us to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields that...
متن کاملRelating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distinguishing equivalence and reducibility to sparse sets, for many-one or 1-truth-table reductions, would imply that P 6= NP, this paper shows that for k-truth-table reductions, k 2, equivalence and reducibility to sparse...
متن کاملReductions to Sets of Low Information Content
In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very exible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces to a sparse set, then P = NP. We also s...
متن کامل