Complexity issues in bivariate polynomial factorization

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 42-49

  Bostan, A ^a   Lecerf, G ^b   Salvy, B ^c   Schost, E ^a   Wiebelt, B ^a  

^a STIX   (France)

^b Institut Universitaire de France   (France)

^c ALGO   (Switzerland)

Author keywords

Computer algebra; Hensel lifting; Multi moduli; Polynomial factorization; Tellegen; Transposition principle

Indexed keywords

ALGEBRA; ALGORITHMS; LINEAR EQUATIONS; MATHEMATICAL MODELS;

COMPUTER ALGEBRA; HENSEL LIFTING; MULTI-MODULI; POLYNOMIAL FACTORIZATION; TELLEGEN; TRANSPOSITION PRINCIPLE;

POLYNOMIALS;

EID: 4944241836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005294     Document Type: Conference Paper

References (34)

1. K. Belabas, M. van Hoeij, J. Klüners, and A. Steel. Factoring polynomials over global fields. 2003.
2. L. Bernardin. On bivariate Hensel lifting and its parallelization. In ISSAC'98, pages 96-100. ACM Press, 1998.
3. D. J. Bernstein. Fast multiplication and its applications. Manuscript, 2003.
4. A. Bostan, G. Lecerf, and É. Schost. Tellegen's principle into practice. In ISSAC'03, pages 37-44. ACM Press, 2003.
5. A. Bostan, B. Salvy, and É. Schost. Fast algorithms for zero-dimensional polynomial systems using duality. AAECC, 14(4):239-272, 2003.
6. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory. Springer, Berlin, 1997.
7. S. Gao. Factoring multivariate polynomials via partial differential equations. Math. Comp., 72:801-822, 2003.
8. J. von zur Gathen. Hensel and Newton methods in valuation rings. Math. Comp., 42(166):637-661, 1984.
9. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, 1st edition, 1999.
10. J. von zur Gathen and E. Kaltofen. Factoring sparse multivariate polynomials. J. Comput. System Sci., 31:265-287, 1985.
11. J. von zur Gathen and E. Kaltofen. Factorization of multivariate polynomials over finite fields. Math. Comp., 45:251-261, 1985.
12. G. Hanrot, M. Quercia, and P. Zimmermann. The Middle Product Algorithm, I. Appl. Algebra Engrg. Comm. Comput., 14(6):415-438, 2004.
13. M. van Hoeij. Factoring polynomials and the knapsack problem. J. Number Theory, 95(2): 167-189, 2002.
14. E. Kaltofen. Polynomial factorization. In B. Buchberger, G. Collins, and R. Loos, editors, Computer algebra, pages 95-113. Springer, 1982.
15. E. Kaltofen. Sparse Hensel lifting. In EUROCAL'85, Vol. 2 (Linz, 1985), volume 204 of LNCS, pages 4-17. Springer, Berlin, 1985.
16. E. Kaltofen. Factorization of polynomials given by straight-line programs. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 375-412. JAI, 1989.
17. E. Kaltofen. Polynomial factorization: a success story. In ISSAC'03, pages 3-4. ACM Press, 2003.
18. E. Kaltofen and B. Trager. Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separations of numerators and denominators. J. Symb. Comput., 9(3):301-320, 1990.
19. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity, 19(4):564-596, 2003.
20. A. K. Lenstra. Factoring multivariate polynomials over finite fields. J. Comput. System Sci., 2:235-248, 1985.
21. D. R. Musser. Multivariate polynomial factorization. J. Assoc. Comput. Mach., 22:291-308, 1975.
22. K. Nagasaka and T. Sasaki. Approximate multivariate polynomial factorization and its time complexity, 1998. preprint.
23. M. Noro and K. Yokoyama. Yet another practical implementation of polynomial factorization over finite fields. In ISSAC'02, pages 200-206. ACM Press, 2002.
24. T. Sasaki, T. Saito, and T. Hilano. Analysis of approximate factorization algorithm. I. Japan J. Indust. Appl. Math., 9(3):351-368, 1992.
25. T. Sasaki and M. Sasaki. A unified method for multivariate polynomial factorizations. Japan J. Indust. Appl Math., 10(1):21 39, 1993.
26. T. Sasaki, M. Suzuki, M. Kolář, and M. Sasaki. Approximate factorization of multivariate polynomials and absolute irreducibility testing. Japan J. Indust. Appl. Math., 8(3):357-375, 1991.
27. V. Shoup. NTL: A library for doing number theory. http://www.shoup.net.
28. A. Storjohann. Algorithms, for matrix canonical forms. PhD thesis, ETH, Zürich, 2000.
29. P. S. Wang. An improved multivariate polynomial factoring algorithm. Math. Comp., 32(144):1215-1231, 1978.
30. P. S. Wang and L. P. Rothschild. Factoring multivariate polynomials over the integers. Math. Comp., 29:935-950, 1975.
31. D. Y. Y. Yun. Uniform bounds for a class of algebraic mappings. SIAM J. on Computing, 8:348-356, 1979.
32. H. Zassenhaus. On Hensel factorization I. J. Number Theory, 1(1):291-311, 1969.
33. H. Zassenhaus. A remark on the Hensel factorization method. Math. Comp., 32(141):287-292, 1978.
34. R. Zippel. Effective Polynomial Computation. Kluwer Academic Publishers, 1993.