Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness

DOI10.1016/j.jsc.2017.05.008zbMath1481.11122OpenAlexW2622210887MaRDI QIDQ1690791

Kurt Mehlhorn, Przemysław Koprowski, Saurabh Ray

Publication date: 12 January 2018

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.05.008

zbMATH Keywords

polynomialsconvex hullHong bound

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Real and complex fields (12D99)

Cites Work

• Faster algorithms for computing Hong's bound on absolute positiveness
• Bounds for absolute positiveness of multivariate polynomials

This page was built for publication: Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness