On the distribution of the number of roots of polynomials and explicit weak designs

DOI10.1002/rsa.10095zbMath1051.68149OpenAlexW2059943757MaRDI QIDQ4431434

Ran Raz, Tzvika Hartman

Publication date: 22 October 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10095

zbMATH Keywords

combinatorial designsextractors

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20)

Related Items (4)

Paradigms for Unconditional Pseudorandom Generators ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ Typically-correct derandomization for small time and space

Cites Work

• On recycling the randomness of states in space bounded computation
• Extracting all the randomness and reducing the error in Trevisan's extractors

This page was built for publication: On the distribution of the number of roots of polynomials and explicit weak designs