News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by dragontamer on Monday July 19, 2021 @05:57PM (#27887726)
More importantly, if it turns out that P = NP through a O(n^1,000,000,000,000) algorithm, then you've proven P = NP but no one is breaking much security any time soon.

But even finding a O(n^big_number) (where big_number is a googleplex, or graham's number... or some other absurdity) would be a huge advancement in theoretical computer science.

There are no comments on this comment yet.