P vs. NP and the Computational Complexity Zoo
4 人推荐 · 跨 5 个月 · 2015–2026
中文导读
受 Complexity Zoo 启发制作的 11 分钟动画短片，带你通俗搞懂 P vs. NP 以及更广阔的计算复杂度图谱，完全零计算机科学门槛。
为什么 HN 推它
HN 多次推崇的极品短片，毫无理论基础的人也能轻松看懂，是了解 P vs. NP 和计算复杂度理论最幽默直观的启蒙。
「如果你完全没有背景知识，这支 10 分钟短片是认识 P = NP 和计算复杂度理论的最佳捷径。」HN 网友原话：This 10 minute video is a great introduction to the P = NP problem and computational complexity theory if you have no context.
英文原摘要（HackerTube / Claude 整理）
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.
HN repeatedly recommends it as the best short, funny introduction to P vs. NP and complexity classes for people with no background.
HN 上的提及
Footnote citation for NP-completeness
This 10 minute video is a great introduction to the P = NP problem and computational complexity theory if you have no context.
Very understandable even without any background on the topic
very funny and also provides a cursory glance at what lies beyond P vs NP
There's a fantastic video I refer to every now and then