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:   / ubehavior  

—

Extra Resources:
hackerdashery’s video:    • P vs. NP and the Computational Comple...  
Wiki: https://en.wikipedia.org/wiki/P_versu...
Cook-Levin Theorem: https://en.wikipedia.org/wiki/Cook–Le...
SAT: https://en.wikipedia.org/wiki/Boolean...
P: https://en.wikipedia.org/wiki/P_(comp...)
NP: https://en.wikipedia.org/wiki/NP_(com...)
EXPTIME: https://en.wikipedia.org/wiki/EXPTIME
NP-complete problems: https://en.wikipedia.org/wiki/List_of...

Picture Credits:
https://commons.wikimedia.org/wiki/Fi... By Thomas Splettstoesser (www.scistyle.com) (Own work) [CC BY-SA 3.0 (https://creativecommons.org/licenses/...)], via Wikimedia Commons
https://cdn.vox-cdn.com/thumbor/PGO0k...