Tag Archives: Breakthrough

Cold Off The Press!

Big news!  It looks like Laci Babai has a quasipolynomial time algorithm for Graph Isomorphism (GI). That is, GI has jumped from the best known algorithm being almost exponential, to being almost polynomial! But, of course, you probably already heard … Continue reading

Posted in Beginner, Community, Landscape, News, TCS | Tagged , , | Leave a comment