Gresham College Lectures cover image

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

Gresham College Lectures

00:00

How to win a million dollars

Colva outlines routes to resolve P vs NP: prove P=NP by solving an NP-complete problem or prove hardness for NP.

Play episode from 40:17
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