News for hackers. Stuff that matters.
Re:Quasi-Polynomial Algorithm for Graph Isomorphism by amelius on Thursday November 05, 2015 @05:42AM (#10512643)
I wonder if bits of the proof could be used for other graph problems. For instance the "clique problem" [1], which is NP complete.

[1] https://en.wikipedia.org/wiki/Clique_problem

There are no comments on this comment yet.