How Hard is too Hard? An Introduction to Complexity
Professor of Pure Mathematics
44:23·2026·undergraduate level·Public Colloquium
An accessible introduction to computational complexity theory, distinguishing between decidable and undecidable problems and exploring the mathematical foundations of efficient algorithms and cryptography.
| Introduction: The Party Planning Problem
| Modelling the Problem as a Graph
| Vertices, Edges & Walking Around the Table
| Why the Seating Plan Fails — and How to Fix It
Comments
Add a comment...Sign in