News for hackers. Stuff that matters.
Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by kevinventullo on Friday May 24, 2019 @04:34PM (#20005033)
I think it's just that many natural algorithms happen to have polynomial time complexity, since it's basically the complexity of iterated loops. Same with logarithms.

There are no comments on this comment yet.