Sciweavers

ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 1 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
FOCM
2008
77views more  FOCM 2008»
13 years 3 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan