On the Bessel polynomials
S. K. Chatterjea (1962)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
S. K. Chatterjea (1962)
Rendiconti del Seminario Matematico della Università di Padova
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...
R. Lidl, Harald Niederreiter (1973)
Acta Arithmetica
Similarity:
Öystein Rödseth (1990)
Acta Arithmetica
Similarity:
S. K. Chatterjea (1960)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Rex Matthews (1982)
Acta Arithmetica
Similarity:
Brison, Owen J. (1993)
Portugaliae mathematica
Similarity:
Akbary, Amir, Wang, Qiang (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Carlitz, L. (1959)
Portugaliae mathematica
Similarity: