Sciweavers

461 search results - page 4 / 93
» Practical polynomial factoring in polynomial time
Sort
View
68
Voted
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 1 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
15 years 4 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...