P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity

---

Connect with us on social! 🌐

[kimjongun]

omg, I learned much more from you in 2 minutes than from my teacher in 1 hour

[aishamalik]

i dont understand the 1:15 part, why would it expand? Finding the solution for NPC?

[lpmlearning]

How did he come up with the conclusion starting at “therefore”, at 1:10 ???

[KOl-xjjt]

problem is p
np is not problem)
simple logic but hardest problem)

[chong-chonghe]

Wow, this guy just claimed that he has disproved the P=NP conjecture! He said, "We are pretty sure NPC problems can't be solved in Polynomial time" ( 1:31 ). which means NPC is not a subset of P. Since NPC is a subset of NP, it means NP is not a subset of P, which means P != NP.