Conference Paper
Quantitative Aspects of SpeedUp and Gap Phenomena.
DOI: 10.1017/S0960129510000174
Conference: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 1822, 2009. Proceedings
Source: DBLP

[Show abstract] [Hide abstract]
ABSTRACT: A set A is nontrivial for the linearexponentialtime class E=DTIME(2lin ) if for any k≥1 there is a set B k ∈E such that B k is (pm)reducible to A and $B_{k} \not\in \mathrm{DTIME}(2^{k\cdot n})$ . I.e., intuitively, A is nontrivial for E if there are arbitrarily complex sets in E which can be reduced to A. Similarly, a set A is nontrivial for the polynomialexponentialtime class EXP=DTIME(2poly ) if for any k≥1 there is a set $\hat{B}_{k} \in \mathrm {EXP}$ such that $\hat{B}_{k} $ is reducible to A and $\hat{B}_{k} \not\in \mathrm{DTIME}(2^{n^{k}})$ . We show that these notions are independent, namely, there are sets A 1 and A 2 in E such that A 1 is nontrivial for E but trivial for EXP and A 2 is nontrivial for EXP but trivial for E. In fact, the latter can be strengthened to show that there is a set A∈E which is weakly EXPhard in the sense of Lutz (SIAM J. Comput. 24:1170–1189, 11) but Etrivial.Theory of Computing Systems 07/2012; 51(1). DOI:10.1007/s0022401193703 · 0.45 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed.
The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual
current impact factor.
Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence
agreement may be applicable.