Pages that link to "Item:Q845866"
From MaRDI portal
The following pages link to How much precision is needed to compare two sums of square roots of integers? (Q845866):
Displaying 6 items.
- On the minimum gap between sums of square roots of small integers (Q719286) (← links)
- Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration (Q1675875) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Sums of square roots that are close to an integer (Q6556213) (← links)
- Approximate equality for two sums of roots (Q6564670) (← links)
