Abstract
The object of this paper was to find an algorithm decreasing either the degree of a given polynomial P or the sum of the degrees of the monomials of P (this last algorithm being easier to perform).
We can also find other algorithms for the simplifications given at II, b. and c. In particular we can transform a given polynomial into a monic polynomial whose degree is minimum (without increasing the number of the monomials).
We can also define another simplification in order to decrease as much as possible the number of factors of all the monomials of a given polynomial. The simplified polynomial has a constant monomial and several monomials with only one factor.
Further information about such simplifications are given in [3]. But all these simplifications are limited by the size of the integer program we have to solve.
Preview
Unable to display preview. Download preview PDF.
Bibliography
R.S. GARFINKEL and G.L. NEMHAUSER, Integer Programming, John Wiley, New-York, 1972.
A.M. OSTROWSKI, On multiplication and factorisation of polynomials, Aequations Math., 13, 1975.
G. VIRY, Simplification des polynômes à plusieurs variables, CALSYF, 3, Ed. Mignotte, Strasbourg, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viry, G. (1984). Simplification of polynomials in n variables. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032831
Download citation
DOI: https://doi.org/10.1007/BFb0032831
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13350-6
Online ISBN: 978-3-540-38893-7
eBook Packages: Springer Book Archive