How much precision is needed to compare two sums of square roots of integers?
From MaRDI portal
Publication:845866
DOI10.1016/j.ipl.2006.05.002zbMath1185.68788OpenAlexW2012326410MaRDI QIDQ845866
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.002
Related Items
Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration, On the Order of Power Series and the Sum of Square Roots Problem, Bounding the sum of square roots via lattice reduction, On the minimum gap between sums of square roots of small integers, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
Cites Work