T. Husfeldt and T. Rauhe. Hardness of dynamic computation. Manuscript, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Searching Constant Width Mazes Captures the AC° Hierarchy - Barrington, Lu, Miltersen, .. (1997) (Correct)
.... If the width is a free parameter m, with the restriction 2 m r, the follow ing is known: Eppstein et al. [6] construct a data structure with a time bound of O(1 r) per operation and Eppstein [5] shows a lower bound of fl(log m log log m) This lower bound is improved by Husfeldt and Rauhe [8] to fl(m) provided m log r loglogr. As we pointed out, our upper bound is 2 2( loglog r. This improves the general bound only for m log log log r. From Beanie and Fich [3] follows a lower bound of fl(log log r log log log r) provided m 2. Combining every thing, we get an upper bound ....
T. Husfeldt and T. Rauhe. Hardness of dynamic computation. Manuscript, 1997.
Searching constant width mazes captures the AC0 hierarchy - Barrington, Lu, Miltersen, .. (1998) (4 citations) (Correct)
.... width is a free parameter m, with the restriction 2 m n, the following is known: Eppstein et al. [6] construct a data structure with a time bound of O(log n) per operation and Eppstein [5] shows a lower bound of Omega Gamma 34 m= log log m) This lower bound is improved by Husfeldt and Rauhe [8] to Omega Gamma m) provided m log n= log log n. As we pointed out, our upper bound is 2 2 O(m) log log n. This improves the general bound only for m log log log n. From Beame and Fich [3] follows a lower bound of Omega Gamma 29 log n= log log log n) provided m 2. Combining everything, we ....
T. Husfeldt and T. Rauhe. Hardness of dynamic computation. Manuscript, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC