On Comparing Sums of Square Roots of Small Integers

DOI10.1007/11821069_22MaRDI QIDQ5756718zbMATH OpenOpenAlexFDO

Authors Qi Cheng

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the minimum gap between sums of square roots of small integers
• Bounding the sum of square roots via lattice reduction
• Finding the smallest gap between sums of square roots
• How much precision is needed to compare two sums of square roots of integers?
• On the Sum of Square Roots of Polynomials and Related Problems

Cited in

(8)

• Finding the smallest gap between sums of square roots
• Bounding the sum of square roots via lattice reduction
• How Small Can a Sum of Roots of Unity Be?
• scientific article; zbMATH DE number 1988975 (Why is no real title available?)
• Sums of square roots that are close to an integer
• Approximate equality for two sums of roots
• On the minimum gap between sums of square roots of small integers
• How much precision is needed to compare two sums of square roots of integers?

This page was built for publication: On Comparing Sums of Square Roots of Small Integers

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