"Graph Isomorphism in Quasipolynomial Time I" Seminar Lecture by László Babai on November 10, 2015

The University of Chicago · 20K views · 2015 · 1:40:07

Open on YouTube

Algorithms & data structuresother

Why the open web links it

László Babai presents his breakthrough on solving the graph isomorphism problem in quasipolynomial time.

Linked by 3 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including uchicago.edu, developpez.com, naukas.com, gapersblock.com.