Computing the measure of a polynomial

DOI10.1016/S0747-7171(87)80050-0zbMath0629.12002OpenAlexW2074771195MaRDI QIDQ1093675

Luigi Cerlienco, Francesco Piras, Maurice Mignotte

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80050-0

zbMATH Keywords

algorithmsMahler measurecomplexity analysisintegral polynomialroot-squaring algorithm

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09)

Related Items (9)

An inequality about irreducible factors of integer polynomials ⋮ A relative van Hoeij algorithm over number fields ⋮ On finding the largest root of a polynomial ⋮ Linear forms in two logarithms and Schneider's method (III) ⋮ Testing degenerate polynomials ⋮ A verified implementation of the Berlekamp-Zassenhaus factorization algorithm ⋮ Finite-dimensional Mahler measure of a polynomial and Szegö's theorem ⋮ On the product of the largest roots of a polynomial ⋮ Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result

Cites Work

• Suites récurrentes linéaires. Propriétés algébriques et arithmétiques. (Linear recurrent sequences. Algebraic and arithmetic properties)
• Factorization of certain cyclotomic functions
• On a question of Lehmer and the number of irreducible factors of a polynomial
• An Inequality About Factors of Polynomials
• Heights of Algebraic Numbers and Szego's Theorem
• On a conjecture of D. H. Lehmer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the measure of a polynomial