The expression of a polynomial as a sum of three irreducibles
D. Hayes (1966)
Acta Arithmetica
Similarity:
D. Hayes (1966)
Acta Arithmetica
Similarity:
Al-Salam, W.A., Chihara, T.S. (1979)
Portugaliae mathematica
Similarity:
William Webb (1973)
Acta Arithmetica
Similarity:
Laureano González Vega (1990)
Extracta Mathematicae
Similarity:
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm. In this note, generalizing a forgotten construction appearing in [Hab], we extend the...
Roberto Dvornicich, Umberto Zannier (1983)
Acta Arithmetica
Similarity:
Andrzej Schinzel (1984)
Acta Arithmetica
Similarity:
L Carlitz (1962)
Acta Arithmetica
Similarity:
Andrej Dujella, Tomislav Pejković (2011)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Grzegorz Rzadkowski, Leszek Zaremba (2010)
Control and Cybernetics
Similarity: