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.

• Type: Conference
• Year: 2007
• Where: COCO
• Authors: Marius Zimand
• Keywords: COCO 2007, There Exists