Reducing the seed length in the Nisan-Wigderson generator

DOI10.1007/S00493-006-0036-8zbMath1121.68052OpenAlexW2033385084MaRDI QIDQ879167

Ronen Shaltiel, Avi Wigderson, Russell Impagliazzo

Publication date: 8 May 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-006-0036-8

zbMATH Keywords

pseudo-random generatorexplicit constructionoptimal seed length

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Reconstructive dispersers and hitting set generators ⋮ \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Amplification and Derandomization without Slowdown

This page was built for publication: Reducing the seed length in the Nisan-Wigderson generator