Factoring polynomials and the knapsack problem

Journal of Number Theory

Volumn 95, Issue 2, 2002, Pages 167-189

  Van Hoeij, Mark ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036696751     PISSN: 0022314X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-314X(01)92763-5     Document Type: Article

References (19)

1. J. Abbott, V. Shoup, and P. Zimmermann, Factorization in ℤ[x]: The searching phase, in "ISSAC'2000 Proceedings," pp. 1-7, 2000.
2. W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235-265.
3. H. Cohen, Pari-GP, now maintained by K. Belabas, http://www.parigp-home.de.
4. H. R. P. Ferguson, D. H. Bailey, and S. Arno, Analysis of PSLQ, an integer relation finding algorithm, "manuscript," 1995, http://www.cecm.sfu.ca/organics/papers/bailey.
5. G. Hanrot and P. Zimmermann, Implementation, http://www.loria.fr/~zimmerma/free.
6. M. van Hoeij, Factorization of differential operators with rational functions coefficients, J. Symbolic Comput. 24 (1997), 537-561.
7. M. van Hoeij, Implementation, http://www.math.fsu.edu/~hoeij/knapsack.html.
8. E. Kaltofen, Polynomial factorization, in "Computer Algebra" (B. Buchberger et al., eds) 2nd ed., pp. 95-113, Springer-Verlag, Berlin, 1982.
9. H. Koy and C. P. Schnorr, Segment LLL-reduction of lattice bases, "Cryptography and Lattices Conference (CaLC)," 2001.
10. A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515-534.
11. M. Mignotte, An inequality about factors of polynomials, Math. Comput. 28 (1974), 1153-1157.
12. V. Miller, Factoring polynomials via relation-finding, "ISTCS '92," Springer Lecture Notes in Computer Science, Vol. 601, pp. 115-121, Springer, Berlin, 1992.
13. T. Sasaki, T. Saito, and T. Hilano, A unified method for multivariate polynomial factorization, Japan J. Ind. Appl. Math. 1 (10) (1993), 21-39.
14. A. Schönhage, "Factorization of Univariate Integer Polynomials by Diophantine Approximation and an Improved Basis Reduction Algorithm," Lecture Notes in Computer Science, Vol. 172, pp. 436-447, Springer-Verlag, Berlin, 1984.
15. C. P. Schnorr and M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Math. Programming 66 (1994), 181-191.
16. V. Shoup, NTL, A library for doing number theory, http://www.shoup.net/.
17. A. Storjohann, "Faster Algorithms for Integer Lattice Basis Reduction," Technical Report 249, Departement Informatik, ETH Zurich, 1996.
18. B. de Weger, Solving exponential diophantine equations using lattice basis reduction algorithms, J. Number Theory 26 (1987), 325-367.
19. H. Zassenhaus, On Hensel factorization, I., J. Number Theory 1 (1969), 291-311.