Sciweavers

Share
4 search results - page 1 / 1
» Exposure-Resilient Extractors and the Derandomization of Pro...
Sort
View
CC
2008
Springer
131views System Software» more  CC 2008»
8 years 3 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
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...
Marius Zimand
COCO
2007
Springer
126views Algorithms» more  COCO 2007»
8 years 9 months ago
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...
Marius Zimand
FOCS
1999
IEEE
8 years 7 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
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...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
FOCS
2003
IEEE
8 years 8 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
books