Factoring Multivariate Polynomials over Algebraic Number Fields
نویسنده
چکیده
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented in the algebraic manipulation system MACSYMA.** Some machine examples with timing are included.
منابع مشابه
Factoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کاملA Lecture on the Complexity of Factoring Polynomials over Global Fields
This paper provides an overview on existing algorithms for factoring polynomials over global fields with their complexity analysis from our experiments on the subject. It relies on our studies of the complexity of factoring parametric multivariate polynomials that is used for solving parametric polynomial systems in our PhD thesis. It is intended to be useful to two groups of people: those who ...
متن کاملFactorization of Polynomials by E. Kaltofen Abstract Algorithms for factoring polynomials in one or more variables over various coefficient
Algorithms for factoring polynomials in one or more variables over various coefficient domains are discussed. Special emphasis is given to finite fields, the integers, or algebraic extensions of the rationals, and to multivariate polynomials with integral coefficients. In particular, various squarefree decomposition algorithms and Hensel lifting techniques are analyzed. An attempt is made to es...
متن کاملFactoring multivariate polynomials via partial differential equations
A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation that gives a system of linear equations. Like Berlekamp’s and Niederreiter’s algorithms for factoring univariate polynomials, the dimension of the solution space of the linear system is equal to th...
متن کاملFactoring Polynominals over p-Adic Fields
We give an efficient algorithm for factoring polynomials over finite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 16 شماره
صفحات -
تاریخ انتشار 1984