On the greatest common divisor of two univariate polynomials, II
A. Schinzel (2001)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A. Schinzel (2001)
Acta Arithmetica
Similarity:
Alkiviadis G. Akritas (1987/88)
Numerische Mathematik
Similarity:
Ferdinand Kraffer, Soňa Pejchová, Michael Šebek (1994)
Kybernetika
Similarity:
Jan Ježek (1983)
Kybernetika
Similarity:
Michael Šebek (1983)
Kybernetika
Similarity:
Nikos E. Mastorakis (1996)
Kybernetika
Similarity:
Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2015)
Serdica Journal of Computing
Similarity:
In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of 1853, to compute(2) the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853, and E. B. Van Vleck, in 1900. (4) In this paper we extend the work by Pell...