An Inequality About Factors of Polynomials
From MaRDI portal
Publication:4053736
DOI10.2307/2005373zbMath0299.12101OpenAlexW4250301806MaRDI QIDQ4053736
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2005373
Polynomials in real and complex fields: factorization (12D05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items
Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles, An Improved Multivariate Polynomial Factoring Algorithm, Computing the measure of a polynomial, Factoring multivariate integral polynomials, Certified approximate univariate GCDs, An inequality about irreducible factors of integer polynomials, Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant, A relative van Hoeij algorithm over number fields, Polynomial factorization algorithms over number fields, Computer algebra applied to itself, Solving systems of polynomial inequalities in subexponential time, Improving root separation bounds, Polynomial Minimum Root Separation, Factorisation sur $\mathbb {Z}[X$ des polynômes de degré élevé à l’aide d’un monomorphisme], Approximating the chromatic polynomial is as hard as computing it exactly, Reachability in Linear Dynamical Systems, On the separation of the roots of the generalized Fibonacci polynomial, Methodologies of Symbolic Computation, Factoring polynomials with rational coefficients, Detecting lacunary perfect powers and computing their roots, Approximate polynomial GCD over integers, Computing Omega-Limit Sets in Linear Dynamical Systems, The distribution of the zeros generated by length-bounded polynomials, Factoring polynomials over global fields. I, New bounds for the Descartes method, Factoring Multivariate Polynomials over Algebraic Number Fields, A heuristic irreducibility test for univariate polynomials, Polynomial time algorithms for sentences over number fields, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result, List decoding of number field codes, An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Factoring polynomials and the knapsack problem, Algorithms related to the decomposition of polynomials, Linear forms in two logarithms and Schneider's method, On the smallest number of terms of vanishing sums of units in number fields, On p-adic computation of the rational form of a matrix, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], New Algorithms for Solving Zero-Sum Stochastic Games, On computing subfields. A detailed description of the algorithm, Generalizations of Gonçalves' inequality, Computing rational forms of integer matrices, Fast Hensel's lifting implementation using partial fraction decomposition
Cites Work
