Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

COCO
2007
Springer

favoriteEmaildiscussreport

126views Algorithms» more COCO 2007»

On Derandomizing Probabilistic Sublinear-Time Algorithms

13 years 10 months ago

On Derandomizing Probabilistic Sublinear-Time Algorithms

Download triton.towson.edu

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

Real-time Traffic

COCO 2007 | There Exists |

claim paper

Related Content

» ExposureResilient Extractors and the Derandomization of Probabilistic Sublinear Time

» Approximating the Minimum Spanning Tree Weight in Sublinear Time

» Derandomization of Probabilistic Auxiliary Pushdown Automata Classes

» Uniform Derandomization from Pathetic Lower Bounds

» Pseudorandomness and Combinatorial Constructions

» Dual weak pigeonhole principle Boolean complexity and derandomization

» Derandomizing homomorphism testing in general groups

» NearOptimal Conversion of Hardness into PseudoRandomness

» Derandomized Parallel Repetition of Structured PCPs

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	COCO
Authors	Marius Zimand

Comments (0)