Re:A Quasipolynomial Time Algorithm for Graph Isomorphism: T...
by lmkg on Thursday November 12, 2015 @04:05PM
(#10556119)
There are good practical implementations of SAT solvers as well (except degenerate cases), even though SAT is the canonical NP-Complete problem.
[ Parent
| on HN ]
Re:A Quasipolynomial Time Algorithm for Graph Isomorphism: T...
by abetusk on Thursday November 12, 2015 @05:24PM
(#10556581)
Fair enough, though I think the problem space is substantially different (though I didn't mention it above). It's much easier to make (random) 3-SAT difficult instances whereas for GI you needed highly structured graphs. Apparently Johnson graphs were one of the classes of graphs that caused people problems in GI.