Gresham College Lectures cover image

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

Gresham College Lectures

00:00

Quantum computing and NP-complete problems

Colva describes quantum speedups like factoring but notes no known quantum solution for NP-complete problems.

Play episode from 32:20
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