A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

In fact, this problem contains enough structure that computer scientists have developed a fast procedure (or algorithm) for it that bypasses the need for an exhaustive search.

Computer scientist Richard Karp, of the University of California at Berkeley, __showed that the traveling salesman problem is “NP-hard,” which means that it has no efficient algorithm (unless ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal.