Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1991 Copyright 1991 Universität Bonn, Institut für Informatik, Abt. V
8564

An (\epsilon, \delta)-Approximation Algorithm of the Number of Zeros of a Multilinear Polynomial over GF[q]
Marek Karpinski, Barbara Lhotzky
[Download PostScript] [Download PDF]

We construct a polynomial time $(\e,\d)$-approximation algorithm for estimating the number of zeros of an arbitrary multilinear polynomial $f(\xes)$ over \gf{q}. This extends the recent result of Karpinski/Luby (\cite{KL90a}) on approximating the number of zeros of polynomials over the field \gf{2}.

Last Change: 11/05/14 at 09:38:09
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope