Zero testing and equation solving for sparse polynomials on rectangular domains
From MaRDI portal
Abstract: We consider sparse polynomials in variables over a finite field, and ask whether they vanish on a set , where is a set of nonzero elements of the field. We see that if for a polynomial , there is with , then there is such a in every sphere inside , where the radius of the sphere is bounded by a multiple of the logarithm of the number of monomials that appear in . A similar result holds for the solutions of the equations inside .
Recommendations
Cites work
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- CC-circuits and the expressive power of nilpotent algebras
- Chevalley's theorem with restricted variables
- Chevalley-Warning type results on abelian groups
- Combinatorial Nullstellensatz
- Démonstration d'une hypothèse de M. Artin
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1759404 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
This page was built for publication: Zero testing and equation solving for sparse polynomials on rectangular domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6191070)