Gresham College Lectures cover image

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

Gresham College Lectures

00:00

NP-completeness and its significance

Colva explains NP-complete problems, their history, and why solving one quickly would solve all NP problems.

Play episode from 28:26
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