On the minimum gap between sums of square roots of small integers
From MaRDI portal
Publication:719286
DOI10.1016/J.TCS.2011.06.014zbMATH Open1222.68397OpenAlexW2092131474MaRDI QIDQ719286FDOQ719286
Authors: 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
Recommendations
- Finding the smallest gap between sums of square roots
- On Comparing Sums of Square Roots of Small Integers
- Publication:3211410
- The gaps between sums of two squares
- On the distribution of gaps between squarefree numbers
- THE NUMBER OF INTEGERS REPRESENTABLE AS A SUM OF TWO SQUARES ON SMALL INTERVALS
- The distribution of squarefree integers in small intervals
- On Gaps Between Squarefree Numbers II
- scientific article; zbMATH DE number 4059507
- Sums of squares in \(S\)-integers
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational excursions in analysis and number theory
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Factoring numbers in O(log n) arithmetic steps
- A survey on \(k\)-freeness
- On A 4 + B 4 + C 4 = D 4
- Reducing Randomness via Irrational Numbers
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Finding the smallest gap between sums of square roots
- Enumerating solutions to π(π)+π(π)=π(π)+π (π)
- On Comparing Sums of Square Roots of Small Integers
- How much precision is needed to compare two sums of square roots of integers?
Cited In (7)
- Title not available (Why is that?)
- Approximate equality for two sums of roots
- On Comparing Sums of Square Roots of Small Integers
- How much precision is needed to compare two sums of square roots of integers?
- Finding the smallest gap between sums of square roots
- Bounding the sum of square roots via lattice reduction
- Sums of square roots that are close to an integer
This page was built for publication: On the minimum gap between 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 Q719286)