Opinions expressed on these pages were the views of the writers and did not necessarily reflect the views and opinions of the American Mathematical Society.
Tag Archives: computational complexity
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