Proof — Graph isomorphism in quasipolynomial time
Statement
GI in exp(O(log n)^c); group theory algorithms. Proved in ZFC.
Source
Donald E. Knuth Prize 2015. GI in exp(O(log n)^c); group theory algorithms. Proved in ZFC.
Domains
computer-science
GI in exp(O(log n)^c); group theory algorithms. Proved in ZFC.
Donald E. Knuth Prize 2015. GI in exp(O(log n)^c); group theory algorithms. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/proof/babai-knuth-2015/