Factoring multivariate polynomials over finite fields
作者:
Highlights:
•
摘要
This paper describes an algorithm for the factorization of multivariate polynomials with coefficients in a finite field that is polynomial-time in the degrees of the polynomial to be factored. The algorithm makes use of a new basis reduction algorithm for lattices over Fq[Y].
论文关键词:
论文评审过程:Received 10 June 1983, Revised 15 November 1984, Accepted 21 December 1984, Available online 2 December 2003.
论文官网地址:https://doi.org/10.1016/0022-0000(85)90016-9