Sciweavers

Share
COCO
2007
Springer

On Derandomizing Probabilistic Sublinear-Time Algorithms

8 years 9 months ago
On Derandomizing Probabilistic Sublinear-Time Algorithms
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2−Ω(T (n) log T (n)) fraction of inputs of length n.
Marius Zimand
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where COCO
Authors Marius Zimand
Comments (0)
books