P vs. NP - An Introduction

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

—

Extra Resources:

Picture Credits:

[zoecarlibur]

The is the best explanation I ever heard on this topic.

[viniciusmartinez]

I'm a CS student, your videos are helping me paint an intuitive picture of some of the the topics in my courses' syllabus. I find that most books lack that key part of understanding, being able to create intuitive models. I subbed. Great work!

[luke-da-duke]

The clarity with which you're able to explain such complex topics is unbelievable.

[Joghurt]

I've just passed my last uni math class so now I can finally enjoy math again without having anxiety

[vicmpen]

Hearing that some problems are impossible to solve, really got me down.

[priyadarshianu]

finally! after 10 years of being introduced to this, I understand it. phewww....

[MrHatoi]

I knew it.







The SAT is the hardest test in existence.

[diyasharma]

Good lord. I was mesmerised by your ability to encapsulate an immensely complex subject in just a ten minute video. UNBELIEVABLE. Thank you!

[DudeWhoSaysDeez]

Out of the 7 problems (that if you solve them you get a million dollars), i find p vs np to be the most interesting and most practical one that we should keep investigating

[paulmin]

Amazing bro. Your videos are a work of art.

[irlserver]

Nice! Keep up the quality work, I always look forward to your vids.

[tmahad]

I am currently working on the SAT problem and its polynomial solution. So far i have made a huge progress

[N]

Of the explanations of these complex topics, this is the best I've seen. Kudos to Cory.

[want-diversecontent]

My method to solve jigsaw puzzles is to solve the corners first, then the edges, then the harder problem: the centers

[Rannoch_]

You are the YT channel I wish I had started <3
Love your work!

[PvblivsAelivs]

If P were found to be equal to NP, it would cripple _all_ of cryptography. Most cryptographic algorithms rely on a secret key. But if finding that key were made no more difficult than checking to see if it worked, only the one-time pad would be spared.

[ahasdasetodu]

What you described under hamiltonian path is actually an euler path, hamiltonian is such that every vertex (in this case city) is visited exactly once

[StoneColdProfessor]

Less than 3 seconds in and you've got a new subscriber. :)

[hkpatnaik]

Best explanation of Big O in the whole you tube universe

[noli-timere-crede-tantum]

Sounds like my parents explaining stuff to me in my childhood: makes the topic at hand sound profoundly complicated, but keeps using the words, "we just don't know."