Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Ham radio enthusiasts vs. High-frequency traders: A battle for the airwaves. Parent comment
The statement of P vs NP is different from what most non-mathematicians and non-computer-scientists think:
- It is possible that P=NP, but the the asymptotically fastest algorithm is provable, say, O(n^(2^64)).
- It is possible that P≠NP, but there exists an algorithm of O(n^(log log log log log log log log n)) where the constant in O(...) is small.
There are no comments on this comment yet.
The statement of P vs NP is different from what most non-mathematicians and non-computer-scientists think:
- It is possible that P=NP, but the the asymptotically fastest algorithm is provable, say, O(n^(2^64)).
- It is possible that P≠NP, but there exists an algorithm of O(n^(log log log log log log log log n)) where the constant in O(...) is small.