Algorithm Solves Graph Isomorphism in Record Time (2015)

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by aDfbrtVt on Friday May 24, 2019 @03:56PM (#20004783)

Here's the updated paper with some significant corrections http://people.cs.uchicago.edu/~laci/upcc-fix.pdf

[ Parent | on HN ]

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by svat on Friday May 24, 2019 @11:41PM (#20006969)

There's an expository paper by Harald Helfgott that goes into earlier work, more foundational stuff, etc — even has exercises: https://arxiv.org/abs/1710.04574

(Originally presented for the Bourbaki Seminar, so not exactly for the non-mathematician, but has more context than reading the paper directly.)

[ Parent | on HN ]

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by chmod775 on Friday May 24, 2019 @08:32PM (#20006401)

Those are just the corrections, not the full paper.

[ Parent | on HN ]

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by dmix on Friday May 24, 2019 @09:02PM (#20006503)

This is the full paper the OP was referring to: http://people.cs.uchicago.edu/~laci/17groups/version2.1.pdf

The fixes linked above are mentioned in the WARNING below the abstract and explained at 18.1.

[ Parent | on HN ]

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by zemptime on Saturday May 25, 2019 @06:11PM (#20011785)

On page 2, in the "coherent configuration" section, what does the x with the - through it mean? I haven't been able to search my way to an answer

[ Parent | on HN ]