Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on A surprisingly hard CS problem: sums of square roots (2018). Parent comment
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.
There are no comments on this comment yet.
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.