Tag Archives: Harald Helfgott

Update on Babai’s result

I learned yesterday that Harald Helfgott had found a mistake in László Babai’s result on the complexity of graph isomorphism. The algorithm and the bulk of the analysis still stands; it was just problem with the accounting showing that the … Continue reading

Posted in Uncategorized | Tagged , , | Leave a comment