Pages that link to "Item:Q1977120"
From MaRDI portal
The following pages link to A strong and easily computable separation bound for arithmetic expressions involving radicals (Q1977120):
Displaying 10 items.
- On the minimum gap between sums of square roots of small integers (Q719286) (← links)
- How much precision is needed to compare two sums of square roots of integers? (Q845866) (← links)
- Constructive root bound for \(k\)-ary rational input numbers (Q861279) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- A separation bound for real algebraic expressions (Q2391181) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Much Ado about Zero (Q3644735) (← links)
- Hypergeometric Functions in Exact Geometric Computation (Q4916183) (← links)
- What can we do with a Solution? (Q4916188) (← links)
