Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
From MaRDI portal
Publication:1198240
DOI10.1016/S0747-7171(10)80006-9zbMath0757.30002MaRDI QIDQ1198240
Publication date: 16 January 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Polynomials in general fields (irreducibility, etc.) (12E05) Inequalities for trigonometric functions and polynomials (26D05) Polynomials and rational functions of one complex variable (30C10)
Related Items
Classical complexity and quantum entanglement, Polynomials with complex coefficients: size of the factors, repartition of the zeros, Certified approximate univariate GCDs, A relative van Hoeij algorithm over number fields, Perturbation results on the zero-locus of a polynomial, Computational aspects of irreducible polynomials, Factoring polynomials over global fields. I, An Inequality for Products of Polynomials, Inequalities between height and deviation of polynomials, Massively parallel computations on many-variable polynomials, A constructive version of the Boyle-Handelman theorem on the spectra of nonnegative matrices, Lower bounds for norms of products of polynomials via Bombieri inequality, The Hadamard product of polynomials in \(H^0\)
Cites Work
- Unnamed Item
- Unnamed Item
- Products of polynomials in many variables
- Computing the measure of a polynomial
- An inequality about irreducible factors of integer polynomials
- On Hensel factorization. I
- New Algorithms for Polynomial Square-Free Decomposition over the Integers
- An application of Jensen's formula to polynomials
- An Inequality About Factors of Polynomials