Factoring Polynomials and 0—1 Vectors
- 1.2k Downloads
A summary is given of an algorithm, published in , that uses lattice reduction to handle the combinatorial problem in the factoring algorithm of Zassenhaus. Contrary to Lenstra, Lenstra and Lovász, the lattice reduction is not used to calculate coefficients of a factor but is only used to solve the combinatorial problem, which is a problem with much smaller coefficients and dimension. The factors are then constructed efficiently in the same way as in Zassenhaus’ algorithm.
Unable to display preview. Download preview PDF.
- 3.V. Miller, Factoring polynomials via Relation-Finding. ISTCS’92, Springer Lecture Notes in Computer Science 601, 115–121 (1992).Google Scholar
- 4.M. van Hoeij, Factoring polynomials and the knapsack problem, preprint available from http://www.math.fsu.edu/~hoeij/ accepted for Journal of Number Theory (2000).