Practical polynomial factoring in polynomial time - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Practical polynomial factoring in polynomial time

(1) , (2) , (3, 4)
1
2
3
4

Abstract

An algorithm was presented in Novocin's thesis to factor polynomials in Q[x]. The key result was to show that the number of LLL switches used during the factorization could be bounded by O(r^3 ) where r is the number of factors mod- ulo a prime. The thesis also claimed that it should be possi- ble to design an implementation which (a) in the worst case is comparable to the best implementations in practice and (b) could outperform existing implementations on a large class of polynomials by requiring less Hensel lifting. The goal of this paper is to verify these claims with an actual implementation.
Fichier principal
Vignette du fichier
poly_factor_NOVOCIN_2010.pdf (169.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00546114 , version 1 (13-12-2010)

Identifiers

  • HAL Id : ensl-00546114 , version 1

Cite

William Hart, Mark van Hoeij, Andrew Novocin. Practical polynomial factoring in polynomial time. 2010. ⟨ensl-00546114⟩
285 View
464 Download

Share

Gmail Facebook Twitter LinkedIn More