Gresham College Lectures cover image

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

Gresham College Lectures

00:00

Practical NP problems and backtrack search

Colva demonstrates job scheduling and shows how backtracking algorithms search combinatorial spaces in practice.

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