Pseudorandom generators for low degree polynomials

DOI10.1145/1060590.1060594zbMath1192.68348OpenAlexW2084622077MaRDI QIDQ3581382

Andrej Bogdanov

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060594

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (12)

Exact learning from an honest teacher that answers membership queries ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Small Sample Spaces Cannot Fool Low Degree Polynomials ⋮ Unnamed Item ⋮ Deterministically testing sparse polynomial identities of unbounded degree ⋮ Unnamed Item ⋮ Improved bounds for quantified derandomization of constant-depth circuits and polynomials ⋮ On hitting-set generators for polynomials that vanish rarely

This page was built for publication: Pseudorandom generators for low degree polynomials