Improved bounds on absolute positiveness of multivariate polynomials
DOI10.1016/J.JSC.2019.07.025zbMATH Open1448.14060OpenAlexW2963203423WikidataQ127435453 ScholiaQ127435453MaRDI QIDQ2188981FDOQ2188981
Publication date: 15 June 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2019.07.025
Recommendations
Symbolic computation and algebraic computation (68W30) Numerical approximation and computational geometry (primarily algorithms) (65D99) Computational real algebraic geometry (14Q30)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds for absolute positiveness of multivariate polynomials
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Faster algorithms for computing Hong's bound on absolute positiveness
- Testing positiveness of polynomials
- Bounds for positive roots of polynomials
- Krandick's proof of Lagrange's real root bound claim
- Improvements of Lagrange's bound for polynomial roots
- A Lower Bound on the Complexity of Orthogonal Range Queries
- A New Bound for the Zeros of Polynomials
- A New Polynomial Bound and Its Efficiency
- Bounds on absolute positiveness of multivariate polynomials
- A Lower Bound for Computing Lagrange’s Real Root Bound
- Improved Bounds on Absolute Positiveness of Multivariate Polynomials
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
Cited In (2)
This page was built for publication: Improved bounds on absolute positiveness of multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188981)
