Gresham College Lectures cover image

How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal

Gresham College Lectures

00:00

Progress: quasi-polynomial algorithm breakthrough

Colva describes the 2016 quasi-polynomial-time algorithm for graph isomorphism and subsequent improvements.

Play episode from 38:39
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app