Comparing sums of square roots
Statement
Can sums of square roots of integers be compared in polynomial time on a Turing machine? Equivalently, obtain effective polynomial bit bounds for a nonzero difference of two such sums, with consequences for placing Euclidean optimization problems in NP.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.