Optimal pseudorandom generators for low-degree polynomials over moderately large fields
From MaRDI portal
Cites work
- Arithmetic circuits: a survey of recent results and open questions
- Closed polynomials and saturated subalgebras of polynomial algebras
- Complexity issues in bivariate polynomial factorization
- Constructing small-bias sets from algebraic-geometric codes
- Effective Noether irreducibility forms and applications
- Efficient approximation of product distributions
- Explicit, almost optimal, epsilon-balanced codes
- Factoring multivariate polynomials via partial differential equations
- Fooling polynomials using invariant theory
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Improved dense multivariate polynomial factorization algorithms
- Indecomposability of polynomials via Jacobian matrix
- Indecomposable polynomials and their spectrum
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Numbers of solutions of equations in finite fields
- Progress on polynomial identity testing
- Progress on polynomial identity testing. II
- Pseudorandom bits for polynomials
- Pseudorandom generators for low degree polynomials
- Pseudorandomness
- Randomness efficient identity testing of multivariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Reduzibilität ebener Kurven.
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Simple Constructions of Almost k-wise Independent Random Variables
- Small Sample Spaces Cannot Fool Low Degree Polynomials
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- Unconditional pseudorandom generators for low degree polynomials
This page was built for publication: Optimal pseudorandom generators for low-degree polynomials over moderately large fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920794)
