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 討論 ↗