Bounding the sum of square roots via lattice reduction

DOI10.1090/S0025-5718-09-02304-7zbMath1227.11126MaRDI QIDQ3584821

Celi Sun, Xian Meng Meng, Jiazhe Chen, Qi Cheng

Publication date: 30 August 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

boundlattice reductionsum of square roots

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40)

Cites Work

• How much precision is needed to compare two sums of square roots of integers?
• A hierarchy of polynomial time lattice basis reduction algorithms
• A problem that is easier to solve on the unit-cost algebraic RAM
• A strong and easily computable separation bound for arithmetic expressions involving radicals
• On the Complexity of Nash Equilibria and Other Fixed Points
• Hardness of approximating the shortest vector problem in lattices
• On Comparing Sums of Square Roots of Small Integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item