On the number of terms of a composite polynomial
Umberto Zannier (2007)
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.
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.
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
Hong Bing Yu (2001)
Acta Arithmetica
Similarity:
Shih Ping Tung (2006)
Acta Arithmetica
Similarity:
A. Schinzel (2008)
Acta Arithmetica
Similarity:
H. Kaufman, Mira Bhargava (1965)
Collectanea Mathematica
Similarity:
James P. Jones (1988)
Banach Center Publications
Similarity:
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
W. Głocki (1987)
Applicationes Mathematicae
Similarity:
R. V. Parker (1973)
Matematički Vesnik
Similarity:
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
Fedor Petrov (2014)
Acta Arithmetica
Similarity:
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.
Karine Chemla (1985)
Publications mathématiques et informatique de Rennes
Similarity: