Understanding P vs. NP: The Biggest Puzzle in Computer Science 🧩

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: https://twitter.com/UBehavior

—

Extra Resources:
hackerdashery’s video: https://youtu.be/YX40hbAHx3s
Wiki: https://en.wikipedia.org/wiki/P_versus_NP_problem
Cook-Levin Theorem: https://en.wikipedia.org/wiki/Cook–Levin_theorem
SAT: https://en.wikipedia.org/wiki/Boolean_satisfiability_problem
P: https://en.wikipedia.org/wiki/P_(complexity)
NP: https://en.wikipedia.org/wiki/NP_(complexity)
EXPTIME: https://en.wikipedia.org/wiki/EXPTIME
NP-complete problems: https://en.wikipedia.org/wiki/List_of_NP-complete_problems

Picture Credits:
https://commons.wikimedia.org/wiki/File%3APyruvate_kinase_protein_domains.png: By Thomas Splettstoesser (www.scistyle.com) (Own work) [CC BY-SA 3.0 (https://creativecommons.org/licenses/by-sa/3.0)], via Wikimedia Commons
https://cdn.vox-cdn.com/thumbor/PGO0kRZpyvRAFfhdAAJ73-w9e98=/0x25:680x408/1600x900/cdn.vox-cdn.com/uploads/chorus_image/image/42598430/deep-blue-kasparov.0.jpeg