P vs. NP is one of the greatest unsolved problems. Just what is it, and why is it so important? Created by: Cory Chang Produced by: Vivian Liu Script Editor: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg Twitter: — Extra Resources: hackerdashery’s video: Wiki: Cook-Levin Theorem: –Levin_theorem SAT: P: (complexity) NP: (complexity) EXPTIME: NP-complete problems: Picture Credits: % : By Thomas Splettstoesser ( ) (Own work) [CC BY-SA 3.0 ( )], via Wikimedia Commons =/0x25:680x408/1600x900/