On Derandomizing Probabilistic Sublinear-Time Algorithms

Marius Zimand
2007 Proceedings - IEEE Conference on Computational Complexity  
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.
doi:10.1109/ccc.2007.19 dblp:conf/coco/Zimand07 fatcat:ar7csockojgwhdh2rwekem3pca