Improved techniques for factoring univariate polynomials
Journal of Symbolic Computation
Multivariate Polynomial Factorization
Journal of the ACM (JACM)
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Factoring univariate integral polynomial in polynomial average time
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Early detection of true factors in univariate polynominal factorization
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
ACM SIGSAM Bulletin
Yet another practical implementation of polynomial factorization over finite fields
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
An efficient algorithm for the computation of Galois automorphisms
Mathematics of Computation
Approximate factorization of polynomials over Z
Proceedings of the 2009 conference on Symbolic numeric computation
Practical polynomial factoring in polynomial time
Proceedings of the 36th international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
In this paper we describe ideas used to accelerate the Searching Phase of the Berlekamp—Zassenhaus algorithm, the algorithm most widely used for computing factorizations in Z[x]. Our ideas do not alter the theoretical worst-case complexity, but they do have a significant effect in practice: especially in those cases where the cost of the Searching Phase completely dominates the rest of the algorithm. A complete implementation of the ideas in this paper is publicly available in the library NTL [16]. We give timings of this implementation on some difficult factorization problems.