Sciweavers

9 search results - page 1 / 2
» Pseudorandom Generators for Combinatorial Checkerboards
Sort
View
ECCC
2010
82views more  ECCC 2010»
13 years 7 months ago
Pseudorandom Generators for Combinatorial Checkerboards
We define a combinatorial checkerboard to be a function f : {1, . . . , m}d {1, -1} of the form f(u1, . . . , ud) = d i=1 fi(ui) for some functions fi : {1, . . . , m} {1, -1}. T...
Thomas Watson
FOCS
1996
IEEE
13 years 11 months ago
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu ...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
CCS
2005
ACM
14 years 23 days ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
CSR
2011
Springer
12 years 10 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov