83 search results - page 1 / 17 » Extractors: optimal up to constant factors |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
COCO
2007
Springer
14 years 4 hour ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
IPL
2002
13 years 5 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
ECCC
2006
13 years 5 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...