Title :
On Derandomizing Probabilistic Sublinear-Time Algorithms
Author_Institution :
Towson Univ., Baltimore
Abstract :
There exists a positive constant alpha < 1 such that for any function T(n) les n alpha and for any problem L isin BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2-Omega (T(n) log T(n)) fraction of inputs of length n.
Keywords :
computational complexity; deterministic algorithms; probability; deterministic algorithm; probabilistic sublinear-time algorithm derandomization; Automata; Circuit simulation; Computational complexity; Computational modeling; Error correction; Error probability; Testing; Tree graphs; Veins;
Conference_Titel :
Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7695-2780-9
DOI :
10.1109/CCC.2007.19
