A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

(Phys.org)—László Babai with the Department of Computer Science and Mathematics at the University of Chicago has caused a lot of excitement in the computer science community by announcing recently ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

Complexity fans and algorithm researchers are excitedly whispering this week about what might be the “the theoretical computer science result of the decade,” in the words of MIT professor Scott ...

A computer scientist has taken his colleagues on a rollercoaster ride. In the span of several days, László Babai of the University of Chicago walked back his earlier claim of making a major advance on ...