Computer scientist claims to have solved the graph isomorphism problem
Thursday, November 12, 2015 - 09:30
in Mathematics & Economics
(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 during a lecture that he had developed an algorithm that solves the graph isomorphism problem. Though not as well known, it is comparable to someone solving the famous traveling salesmen problem.