Resource bounded Kolmogorov complexity, a link between computational complexity and information theory
Erratum: On restricting the size of Oracles compared with restricting access to Oracles
SIAM Journal on Computing
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Reductions to sets of low information content
Complexity theory
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Reductions between disjoint NP-pairs
Information and Computation
Reductions between disjoint NP-Pairs
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
| Hi-index | 0.00 |
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-table and log-Turing reductions of NP sets to sparse sets. One typical example is that if SAT is log-truth-table reducible to a sparse set then NP is contained in DTIME (2^O^(^l^o^g^^^2^n^)). *Generalizations of the main theorem which yields results similar to the main result at arbitrary levels of the polynomial hierarchy and which extend as well to strong nondeterministic reductions. *The construction of an oracle relative to which P NP but there are NP-complete sets which are f(n)-tt-reducible to a tally set, for any f(n) @e @w(log n). This implies that, up to relativization, some of our results are optimal.