A surprisingly hard CS problem: sums of square roots (2018)
It probably has been tried already by someone, but how about this: all square roots can be written as repeating continued fractions [1]. With a bit of work, continued fractions can also be summed [2] and compared. Wouldn't this take less than exponential time?<p>[1] <a href="http://benpaulthurstonblog.blogspot.com/2012/05/estimating-square-roots.html" rel="nofollow">http://benpaulthurstonblog.blogspot.com/2012/05/estimating-s...</a><p>[2] <a href="https://www.jstor.org/stable/1969389" rel="nofollow">https://www.jstor.org/stable/1969389</a>