7 search results - page 2 / 2 » Extractors for a constant number of polynomially small min-e... |
COCO
2007
Springer
13 years 11 months 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 9 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...