“Combinatorics and Theoretical Computer Science Seminar”

Professor László Babai of the University of Chicago presents his recent work on the Graph Isomorphism problem, “Graph Isomorphism in Quasipolynomial Time.”

November 10, 2015

http://people.cs.uchicago.edu/~laci/2015-11-10talk.mp4