P vs. NP and the Computational Complexity Zoo
Overview
An 11-minute animated introduction to P vs. NP and the wider landscape of complexity classes, inspired by the Complexity Zoo wiki. It assumes no background in computer science.
On Hacker News
HN repeatedly recommends it as the best short, funny introduction to P vs. NP and complexity classes for people with no background.
Topics
Sources
Video by hackerdashery, played through YouTube.
Data and selection notes
HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.
HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.
Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.
Selection checks
- SaaS & AI candidates: Topic keywords do not match
- Editor-approved picks: Editorial review is required
What people said