News for hackers. Stuff that matters.
Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by skinner_ on Friday May 24, 2019 @08:13PM (#20006329)
Complexity theorists do care about reductions within subexponential time classes, but it's not a great topic for P vs NP focused Complexity Theory 101. And when you do focus on P vs NP, the dichotomy is quite natural because of the https://en.wikipedia.org/wiki/Exponential_time_hypothesis, the conjecture that a broad class of NP-complete problems are exponential-time.

There are no comments on this comment yet.