Abstract

We develop a probabilistic polynomial time algorithm which on input a polynomial g( x 1,..., x n ) over GF[2], ϵ and δ, outputs an approximation to the number of zeroes of g with relative error at most ϵ with probability at least 1 − δ.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call