Pages that link to "Item:Q1093675"
From MaRDI portal
The following pages link to Computing the measure of a polynomial (Q1093675):
Displaying 9 items.
- Testing degenerate polynomials (Q429757) (← links)
- Finite-dimensional Mahler measure of a polynomial and Szegö's theorem (Q676235) (← links)
- An inequality about irreducible factors of integer polynomials (Q1104972) (← links)
- On the product of the largest roots of a polynomial (Q1198233) (← links)
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result (Q1198240) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- On finding the largest root of a polynomial (Q3201651) (← links)
- Linear forms in two logarithms and Schneider's method (III) (Q3480143) (← links)