P vs. NP and the Computational Complexity Zoo

Why it was recommended

This 10 minute video is a great introduction to the P = NP problem and computational complexity theory if you have no context.

Recommendationaustinl · Original2016-11

What it covers

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. It is for someone meeting the subject for the first time.

Video details

Channel

hackerdashery

Length

10 min 44 sec

Year

2014

More in this topic

• Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
• 28c3: The Science of Insecurity
• "Propositions as Types" by Philip Wadler
• Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
• Math's Fundamental Flaw
• On The Turing Completeness of PowerPoint (SIGBOVIK)