z
|
Abstract:
Abstract. 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 flexible 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 show that any set A that reduces to some sparse set (via various types of reductions) in fact reduces by the same type of reduction to a sparse set that is simple relative to A. We give a complete characterization of the sets of low instance complexity in terms of reductions to tally sets; it follows that if P 6 = NP, then no set of low instance complexity can be complete
Citations
| 76 | Some connections between bounded query classes and non-uniform complexity – Amir, Beigel, et al. - 1990 |
| 26 | Relating equivalence and reducibility to sparse sets – Allender, Hemachandra, et al. - 1992 |
| 20 | Relationship between density and deterministic complexity of NP-complete languages – Berman - 1978 |
| 4 | Bounded truth-table and conjunctive reductions to sparse and tally sets – Arvind, Kobler, et al. - 1992 |
