Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 1991 Copyright 1991 University of Bonn, Department of Computer Science, Abt. V
899

Lower Bounds for the Number of Zeros of Multivariate Polynomials over GF [q]
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF]

We prove lower bounds on the number of zeros of some classes of multivariate polynomials over $GF[q]$ in the function of the number of their terms only. The paper was motivated by some algebraic problems arising from the new randomized approximation techniques of [Karpinski,~Luby~91] and [Karpinski,~Lhotzky~91] for the number of zeros of polynomials over finite fields. %The bounds are expressed in the function of the %number of their terms only.

Last Change: 11/05/14 at 09:39:56
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V