Developers of an algorithm called "Saucy" claim it is able solve combinatorial problems--graph automorphisms--in record time. For instance, the number of Internet router path combinations for sending a message around the world is enormous, but Saucy can find an optimum path in under a second. Saucy can solve even million-variable graph automorphisms, a core problem in computer science, as well as many other benchmark problems in less than a second (see list of under-a-second solutions in figure).

View Article