Re:A Quasipolynomial Time Algorithm for Graph Isomorphism: T...
by wolfgke on Friday November 13, 2015 @10:28AM
(#10560310)
There are other NP-complete problems, where really hard instances are a lot more rare.
[ Parent
| on HN ]
There are no comments on this comment yet.