Factoring multivariate polynomials over algebraic number fields in MACSYMA

Authors:
Paul S. Wang
Affiliations:
Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
ACM SIGSAM Bulletin
Year:
1975

Citing 1
Cited 1

Symbolic integration: the stormy decade

Communications of the ACM

Simplification of radical expressions

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 has been implemented in the algebraic manipulation system MACSYMA. Some machine examples with timing are presented.