Root separation for trinomials

DOI10.1016/j.jsc.2019.02.004zbMath1429.30009arXiv1709.03294OpenAlexW2963165744MaRDI QIDQ2000267

Pascal Koiran

Publication date: 28 June 2019

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

Full work available at URL: https://arxiv.org/abs/1709.03294

zbMATH Keywords

trinomialsroot separation

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials and rational functions of one complex variable (30C10)

Related Items (4)

Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ On the Order of Power Series and the Sum of Square Roots Problem ⋮ Root separation for polynomials with reducible derivative ⋮ Absolute Root Separation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial time algorithm for diophantine equations in one variable
• On solving univariate sparse polynomials in logarithmic time
• An inequality for the discriminant of a polynomial
• A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing
• The Search for a Rolle's Theorem in the Complex Domain
• Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond
• Logarithmic forms and group varieties.
• A near-optimal algorithm for computing real roots of sparse polynomials
• POLYNOMIAL ROOT SEPARATION
• Characterization of entire functions via quadrature
• Absolute Real Root Separation
• Efficiently Computing Real Roots of Sparse Polynomials

This page was built for publication: Root separation for trinomials