Deterministic distinct-degree factorization of polynomials over finite fields

Journal of Symbolic Computation

Volumn 38, Issue 6, 2004, Pages 1461-1470

  Gao, Shuhong ^a   Kaltofen, Erich ^b   Lauder, Alan G B ^c  

^a CLEMSON UNIVERSITY   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Deterministic algorithm; Distinct degree factorization; Multivariate polynomial

Indexed keywords

EID: 4944252950     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.05.004     Document Type: Article

References (20)

1. E.R. Berlekamp Factoring polynomials over finite fields Bell Syst. Tech. J. 46 1967 1853-1859 Republished in revised form: E.R. Berlekamp Algebraic Coding Theory 1968 McGraw-Hill Publ. New York (Chapter 6)
2. L. Bernardin Factoring multivariate polynomials over a finite field. Dissertation, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland 1999 Available at http://bernardin.com/publications.html
3. A. Bostan G. Lecerf B. Salvy E. Schost B. Wiebelt Complexity issues in bivariate polynomial factorization in: J. Gutierrez ed. ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput 2004 ACM Press New York, NY 42-49
4. W.S. Brown J.F. Traub On Euclid's algorithm and the theory of subresultants J. ACM 18 1971 505-514
5. M.C.R. Butler On the reducibility of polynomials over a finite field Quart. J. Math., Oxford Ser. (2) 5 1954 102-107
6. S. Gao Factoring multivariate polynomials via partial differential equations Math. Comp. 72 242 2003 801-822
7. S. Gao A.G.B. Lauder Hensel lifting and polynomial factorisation Math. Comp. 71 2002 1663-1676
8. E. Kaltofen A polynomial-time reduction from bivariate to univariate integral polynomial factorization Proc. 23rd Annual Symp. Foundations of Comp. Sci. IEEE 1982 57-64 journal version in Kaltofen, 1985b
9. E. Kaltofen Fast parallel absolute irreducibility testing J. Symbolic Comput. 1 1 1985 57-67
10. E. Kaltofen J. Symbolic Comput. 9 320 1989 misprint corrections
11. E. Kaltofen Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization SIAM J. Comput. 14 2 1985 469-489
12. E. Kaltofen Deterministic irreducibility testing of polynomials over large finite fields J. Symbolic Comput. 4 1987 77-82
13. E. Kaltofen V. Shoup Subquadratic-time factoring of polynomials over finite fields Math. Comp. 67 223 1998 1179-1197
14. R. Lidl H. Niederreiter Finite Fields 1983 Addison-Wesley Reading, MA, USA (now distributed by Cambridge University Press)
15. M. Noro K. Yokoyama Yet another practical implementation of polynomial factorization over finite fields in: T. Mora ed. Proc. 2002 Internat. Symp. Symbolic Algebraic Comput., ISSAC'02 2002 ACM Press New York, NY 200-206
16. Ŝt. Schwarz On the reducibility of polynomials over a finite field Quart. J. Math. Oxford Ser. (2) 7 1956 110-124
17. J. von zur Gathen J. Gerhard Modern Computer Algebra 1999 Cambridge University Press Cambridge, New York, Melbourne
18. J. von zur Gathen E. Kaltofen Factoring multivariate polynomials over finite fields Math. Comp. 45 1985 251-261
19. J. von zur Gathen V. Shoup Computing Frobenius maps and factoring polynomials Comput. Complexity 2 1992 187-224
20. D.Y.Y. Yun On square-free decomposition algorithms in: R.D. Jenks ed. Proc. 1976 ACM Symp. Symbolic Algebraic Comput. ACM 1976 26-35. SYMSAC was held at IBM Research in Yorktown Heights, New York