Gresham College Lectures cover image

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

Gresham College Lectures

00:00

Measuring algorithm difficulty: polynomial vs exponential

Colva explains time complexity, compares polynomial and exponential growth, and why polynomial time is viewed as practical.

Play episode from 10:35
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