88 search results - page 2 / 18 » Subquadratic-time factoring of polynomials over finite field... |
JSC
2002
13 years 4 months ago
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
AAECC
1997
Springer
13 years 9 months ago
1997
Springer
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
CAP
2010
12 years 11 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
JCT
2011
12 years 11 months ago
2011
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]