Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
A new general derandomization method
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Solvability of systems of polynomial congruences modulo a large prime
Computational Complexity
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Unconditional pseudorandom generators for low degree polynomials
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Small Sample Spaces Cannot Fool Low Degree Polynomials
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Pseudorandom Bits for Polynomials
SIAM Journal on Computing
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with seed length O(d4 log m (1 + log(d ⁄ ε) ⁄ log log m) + log |F|) bits that achieves arbitrarily small bias ε and works whenever |F| is at least polynomial in d, log m, and 1⁄ε. We also present an alternate construction that uses a seed that can be described by O(c2d8m6⁄(c-2) log(d⁄ε) + log |F|) bits (more precisely, O(c2d8m6⁄(c-2)) field elements, each chosen from a set of size poly(cd⁄ε), plus two field elements ranging over all of F), works whenever |F| is at least polynomial in c, d, and 1⁄ε, and has the property that every element of the output is a function of at most c field elements in the input. Both generators are computable by small arithmetic circuits. The main tool used in the construction is a reduction that allows us to transform any "dense" hitting set generator for polynomials into a pseudorandom generator.