Factoring univariate polynomials over the rationals

Authors:
Mark Van Hoeij;Andrew Novocin
Affiliations:
The Florida State University;The Florida State University
Venue:
Factoring univariate polynomials over the rationals
Year:
2008

Citing 0
Cited 7

Factoring univariate polynomials over the rationals

ACM Communications in Computer Algebra
A lifting and recombination algorithm for rational factorization of sparse polynomials

Journal of Complexity
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract

Proceedings of the forty-third annual ACM symposium on Theory of computing
Vector rational number reconstruction

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Practical polynomial factoring in polynomial time

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Gradual sub-lattice reduction and a new complexity for factoring polynomials

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The complexity of factoring univariatepolynomials over the rationals: tutorial abstract

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This thesis presents an algorithm for factoring polynomials over the rationals which follows the approach of the van Hoeij algorithm. The key theoretical novelty in our approach is that it is set up in a way that will make it possible to prove a new complexity result for this algorithm which was actually observed on prior algorithms. One difference of this algorithm from prior algorithms is the practical improvement which we call early termination. Our algorithm should outperform prior algorithms in many common classes of polynomials (including irreducibles).