Zero testing and equation solving for sparse polynomials on rectangular domains

From MaRDI portal



Abstract: We consider sparse polynomials in N variables over a finite field, and ask whether they vanish on a set SN, where S is a set of nonzero elements of the field. We see that if for a polynomial f, there is mathbfcinSN with f(mathbfc)eq0, then there is such a mathbfc in every sphere inside SN, where the radius of the sphere is bounded by a multiple of the logarithm of the number of monomials that appear in f. A similar result holds for the solutions of the equations f1=cdots=fr=0 inside SN.











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)