-
The opinions expressed on these blogs are the views of the writer(s) and do not necessarily reflect the views and opinions of the American Mathematical Society.
Subscribe to Blog via Email
-
- Blogs offered by the AMS
- A Mathematical Word
- Beyond Reviews: Inside MathSciNet
- Capital Currents
- Blogs offered in cooperation with the AMS
- e-Mentoring Network
- Graduate Student Blog
- inclusion/exclusion
- Living Proof
- Math Mamas
- On Teaching and Learning Mathematics
- PhD + epsilon
- Retired Blogs
- Blog on Math 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 co-blogger 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
