P vs. NP and the Computational Complexity Zoo
hackerdashery · 4 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
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.
Why HN recommends it: 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.” Read on HN ↗