On the minimum gap between sums of square roots of small integers

DOI10.1016/j.tcs.2011.06.014zbMath1222.68397OpenAlexW2092131474MaRDI QIDQ719286

Qi Cheng, Yu-Hsin Li

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.014

zbMATH Keywords

computational number theorygeometric computingsum-of-square-roots problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational excursions in analysis and number theory
• How much precision is needed to compare two sums of square roots of integers?
• Factoring numbers in O(log n) arithmetic steps
• A strong and easily computable separation bound for arithmetic expressions involving radicals
• On A 4 + B 4 + C 4 = D 4
• Finding the Smallest Gap between Sums of Square Roots
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)
• Reducing Randomness via Irrational Numbers
• On Comparing Sums of Square Roots of Small Integers

This page was built for publication: On the minimum gap between sums of square roots of small integers