Expressive power of graph neural networks and the Weisfeiler-Lehman test | by Michael Bronstein | Towards Data Science
Computer Scientists and Mathematicians Are Stunned by This Chicago Professor's New Proof – Chicago Magazine
Computational Complexity: Babai Strikes Back
Graph Isomorphism in Quasipolynomial Time II” Seminar Lecture by László Babai on November 24, 2015 - YouTube
Dibujo20151210 Graph Isomorphism in Quasipolynomial Time seminar lecture by Laszlo Babai university chicago - La Ciencia de la Mula Francis
Graph isomorphism in quasipolynomial time II - László Babai - YouTube
Laszlo Babai: Graph Isomorphism in Quasipolynomial Time | MIT CSAIL Theory of Computation
Prof László Babai Speaks at ICM'18 About Graph Isomorphism – Department of Computer Science
László Babai - Finite permutation groups and the Graph Isomorphism problem 2 - YouTube
Graph Isomorphism Vanquished — Again | Quanta Magazine
Two Steps Forward, One Step Back – Bhāvanā
Graph Isomorphism in Quasipolynomial Time I" Seminar Lecture by László Babai on November 10, 2015 | University of Chicago News
Graph isomorphism in quasipolynomial time - László Babai - YouTube
Meanwhile Over In Computer Science
Two Steps Forward, One Step Back – Bhāvanā
László Babai reckons he can decide if two graphs are isomorphic in quasipolynomial time | The Aperiodical
Computational Complexity: Babai Strikes Back
New algorithm cracks graph problem
The Graph Isomorphism Problem | November 2020 | Communications of the ACM
László Babai: "Graph Isomorphism in Quasipolynomial Time," Budapest, January 4, 2016 - YouTube
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs | Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing
Landmark Algorithm Breaks 30-Year Impasse | Quanta Magazine
Graph Isomorphism | MIT CSAIL Theory of Computation
Computer scientist claims to have solved the graph isomorphism problem
