New answers tagged pseudorandomness
2
I believe the best known bound is in Woelfel's "Efficient strongly universal and optimally universal hashing", Theorem 5, which presents a set with $M = N + \lfloor (N - P)/2 \rfloor - 1$, where $P$ is the number of bits in the codomain.
Top 50 recent answers are included
Related Tags
pseudorandomness × 51pseudorandom-generators × 17
cc.complexity-theory × 14
randomness × 10
cr.crypto-security × 9
reference-request × 7
randomized-algorithms × 7
co.combinatorics × 6
derandomization × 6
circuit-complexity × 5
boolean-functions × 5
extractors × 4
expanders × 3
graph-theory × 2
lower-bounds × 2
polynomial-time × 2
fourier-analysis × 2
upper-bounds × 2
sample-complexity × 2
natural-proofs × 2
ds.algorithms × 1
graph-algorithms × 1
complexity-classes × 1
automata-theory × 1
time-complexity × 1