#pvsnp#computationalcomplexity#cook-levintheorem
29K subscribers • 9 videos on Hallway
Beginner. No background in the topic needed.
258K views9 years ago1 recommendation
Computer scienceComputation and complexityAlgorithms
Cory Chang introduces the P vs. NP problem, explaining computational complexity classes and why the question remains unsolved.
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: twitter.com/UBehavior — Extra Resources: hackerdashery’s video: youtu.be/YX40hbAHx3s Wiki: en.wikipedia.org/wiki/P_versus_NP_problem Cook-Levin Theorem: en.wikipedia.org/wiki/Cook–Levin_theorem SAT: en.wikipedia.org/wiki/Boolean_satisfiability_problem P: en.wikipedia.org/wiki/P_(complexity) NP: en.wikipedia.org/wiki/NP_(complexity) EXPTIME: en.wikipedia.org/wiki/EXPTIME NP-complete problems: en.wikipedia.org/wiki/List_of_NP-complete_problems Picture Credits: commons.wikimedia.org/wiki/File%3APyruvate_kinase_protein_do…: By Thomas Splettstoesser (www.scistyle.com) (Own work) [CC BY-SA 3.0 (creativecommons.org/licenses/by-sa/3.0)], via Wikimedia Commons cdn.vox-cdn.com/thumbor/PGO0kRZpyvRAFfhdAAJ73-w9e98=/0x25:68…What people say. Recommended as an intuitive introduction to the P vs. NP problem and computational complexity.
u/justinba1010in r/compsci • Recommends
On “Intuition Behind P=NP ?”