Finding the smallest gap between sums of square roots

DOI10.1007/978-3-642-12200-2_39MaRDI QIDQ3557039zbMATH OpenOpenAlexFDO

Authors Qi Cheng, Yu-Hsin Li

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12200-2_39

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the minimum gap between sums of square roots of small integers
• On Comparing Sums of Square Roots of Small Integers
• Bounding the sum of square roots via lattice reduction
• How much precision is needed to compare two sums of square roots of integers?
• scientific article; zbMATH DE number 1988975

Cited in

(6)

• Bounding the sum of square roots via lattice reduction
• On Comparing Sums of Square Roots of Small Integers
• Sums of square roots that are close to an integer
• On the minimum gap between sums of square roots of small integers
• Parallel complexity of geometric bipartite matching
• How much precision is needed to compare two sums of square roots of integers?

This page was built for publication: Finding the smallest gap between sums of square roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557039)