Pseudorandom Generators for Combinatorial Shapes

DOI10.1137/110854990zbMath1275.68078OpenAlexW2062861676MaRDI QIDQ2848209

Parikshit Gopalan, David Zuckerman, Omer Reingold, Raghu Meka

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110854990

zbMATH Keywords

central limit theoremsderandomizationpseudorandomness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Pseudorandomness via the Discrete Fourier Transform ⋮ Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Bounded Independence Plus Noise Fools Products ⋮ Unnamed Item