Quasi-polynomial algorithms (n^log n) are often faster than exponential algorithms on moderately-siz...
This proposition has not been edited since the history system was added.