9 search results - page 2 / 2 » Pseudorandom Generators for Combinatorial Checkerboards |
ECCC
1998
13 years 9 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
ECCC
2010
13 years 9 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...