News for hackers. Stuff that matters.

A comment on My survey article on P vs. NP (2017). Parent comment

Re:My survey article on P vs. NP (2017) by tgflynn on Tuesday March 23, 2021 @12:22PM (#26556821)
But there aren't a lot of proven bounds on polynomial time complexity either. For all we know it may be possible to solve 3-SAT in linear time.
[ Parent | on HN ]

There are no comments on this comment yet.