scientific article; zbMATH DE number 7330813

DOI10.4086/toc.2020.v016a017zbMath1483.65014OpenAlexW3117043408MaRDI QIDQ5857609

Amir Yehudayoff, Parikshit Gopalan

Publication date: 1 April 2021

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2020.v016a017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

symmetric polynomialshashingpseudorandomnessconcentration\(k\)-wise independence

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (2)

Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item

Cites Work

• A derandomization using min-wise independent permutations
• Pseudorandom generators for space-bounded computation
• Min-wise independent permutations
• Improved pseudorandom generators for combinatorial rectangles
• Randomized geometric algorithms and pseudorandom generators
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Pseudorandomness via the Discrete Fourier Transform
• Efficient approximation of product distributions
• Pseudorandom generators for width-3 branching programs

This page was built for publication: