(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 ...

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 ...

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 ...

Explainable machine learning models have recently emerged as an important part of the research in artificial intelligence and aim at devising methods and techniques that are understandable for humans ...

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 ...

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result could ...