The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We investigate the lower bounds of queries required by the polynomial time Turing reductions from exponential time classes to the sets of small density. For complexity classes E= DTIME$(2^{O(n)})$ and EXP=DTIME$(2^{n^{O(1)}})$, the following results are shown in this paper. (1) For any $aProc. 2nd IEEE Conference on Structure in Complexity Theory, 1987, pp. 138-146],[Proc. 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 222-238].