New explicit pseudorandom generators achieve optimal seed length for read-once group products over any p-group, and near-optimal generators for block products and read-once polynomials modulo any fixed m.
Simple constructions of almost k -wise independent random variables
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Pseudorandom bits for non-commutative programs
New explicit pseudorandom generators achieve optimal seed length for read-once group products over any p-group, and near-optimal generators for block products and read-once polynomials modulo any fixed m.