The INW generator with expander degree independent of n ε-fools length-n width-w permutation branching programs with seed length O((log w + log(1/ε))·log n).
Approximation, Randomization, and Combinatorial Optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Forward-Backward Weight Analysis of INW for Permutation Branching Programs
The INW generator with expander degree independent of n ε-fools length-n width-w permutation branching programs with seed length O((log w + log(1/ε))·log n).