A generalization of a polynomial lemma of Leja
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Displaying similar documents to “A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.”
A generalization of a polynomial lemma of Leja
On the number of terms of a composite polynomial
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
On some properties of polynomial functions
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Intersective sets given by a polynomial
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Explicit constructions of extractors and expanders
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
A formula for the supersingular polynomial
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
Some Iterations for Factoring a Polynomial. II. A Generalization of the Secant Method.
G.W. Stewart (1974)
Numerische Mathematik
Similarity:
Separability of the characteristic polynomial
W. Głocki (1987)
Applicationes Mathematicae
Similarity:
Are the coefficients of a polynomial well-conditioned functions of its roots?
Frank Uhlig (1992)
Numerische Mathematik
Similarity:
Comments on "Some Iterations for Factoring a Polynomial".
A.S. HOUSEHOLDER, G.W. STEWART (1969)
Numerische Mathematik
Similarity:
The reduced length of a polynomial with complex coefficients
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Inclusion of the roots of a polynomial based on Gerschgorin's theorem.
C. Carstensen (1991)
Numerische Mathematik
Similarity:
Addendum to the paper: "On the number of terms of a composite polynomial" (Acta Arith. 127 (2007), 157-167)
Umberto Zannier (2009)
Acta Arithmetica
Similarity:
Near solutions of polynomial equations
Shih Ping Tung (2006)
Acta Arithmetica
Similarity:
Elementary properties of the class of nondeterministic polynomial time computable functions
James P. Jones (1988)
Banach Center Publications
Similarity: