"The complexity of the graph isomorphism problem is one of the most intriguing questions in computer science," says Anastos.

algorithms computational complexity computer science graph theory mathematics polynomials Quanta Podcast All topics. Computer Science. Landmark Algorithm Breaks ... time whose distance from ...

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

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at ...

Wigderson was born in Haifa, Israel, in 1956. By the time he was a teenager, computer scientists were just beginning to sketch a basic theoretical framework that would end up absorbing much of his ...

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.