Sciweavers

14 search results - page 3 / 3
» Extractors and Rank Extractors for Polynomial Sources
Sort
View
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 6 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
FOCS
2000
IEEE
13 years 10 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
13 years 8 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 6 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka