Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on P≠NP proof update. Parent comment
"what if some NP-hard problems could be solved in O(n^(1000^1000))?"
That is polynomial time so those problems would be in P, but in practice they would be intractable.
There are no comments on this comment yet.
"what if some NP-hard problems could be solved in O(n^(1000^1000))?"
That is polynomial time so those problems would be in P, but in practice they would be intractable.