László Babai, of the University of Chicago, announced that he had come up with a new algorithm for the “graph isomorphism” problem, one of the most tantalizing mysteries in computer science. The new algorithm appears to be vastly more efficient than the previous best algorithm, which had held the record for more than 30 years.

Landmark Algorithm Breaks 30-Year Impasse

← previous You can also navigate with left [or] right arrows next →