P vs. NP and the Computational Complexity Zoo
hackerdashery · 4 则 HN 推荐
视频问答
可以让 AI 解释当前片段，或总结整部视频。如果回答附有时间戳，点击即可跳到对应片段。
试着问：这里讲的是什么意思？
需要用 Google 登录。确认前可查看最多会扣除多少积分。
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 推荐的原因： HN repeatedly recommends it as the best short, funny introduction to P vs. NP and complexity classes for people with no background.
“This 10 minute video is a great introduction to the P = NP problem and computational complexity theory if you have no context.” 阅读 HN 讨论 ↗