Integer factorization and graph isomorphism are two common problems for which the best running time algorithm is not known for sure, and more and more complex algorithms achieve better and better running time. This combination of features seems to create a psychological barrier to including some implementation of such algorithms in a standard library. This is a shame because the there are algorithms that are barely super polynomial or work well for small instances.
No comments :
Post a Comment