123 search results - page 1 / 25 » Derandomizing from Random Strings |
COCO
2010
Springer
13 years 8 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
CC
2008
Springer
13 years 5 months ago
2008
Springer
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 w...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...