News for hackers. Stuff that matters.

A comment on A surprisingly hard CS problem: sums of square roots (2018). Parent comment

Re:A surprisingly hard CS problem: sums of square roots (2018) by bshlgrs on Monday January 24, 2022 @06:59PM (#30065936)
(Author here) As far as I know, there are no cases where this actually matters.
[ Parent | on HN ]
Re:A surprisingly hard CS problem: sums of square roots (2018) by tgflynn on Tuesday January 25, 2022 @09:40AM (#30072251)
In your post you say that a PSPACE algorithm exists. Do you have a reference for that algorithm ?

Another commenter here is saying the problem has an explicit exponential or worse lower bound.

If both of those claims are true that would prove P != PSPACE, which would be a very important result.

[ Parent | on HN ]