Subscribe to Blog via Email
AMS Blogs

Recent Posts
Tag Archives: Laszlo Babai
More Graph Isomorphism Drama
That plucky graph isomorphism problem is at it again! In November 2015, University of Chicago computer scientist Laszlo Babai announced an algorithm to determine whether two graphs are isomorphic in quasipolynomial time, and there was much rejoicing. (My coblogger Anna … Continue reading
Meanwhile Over In Computer Science
An algorithm has just been proposed for solving the graph isomorphism problem in quasipolynomial time, dealing a serious blow to hard problems all over the world. But let me first explain what all of those words mean. Graphs, you’ll recall, … Continue reading
Posted in Events, Mathematics and Computing
Tagged complexity theory, Gabriel Gaster, graph theory, Jeremy Kun, Laszlo Babai, Luca Trevisan, P vs NP, Scott Aaronson
2 Comments