Introduction to P and NP

[@maxabruzzi]

This is awesome! I love the way this professor explaining it. I am going to start watching all the lectures to pick up all the knowledge I did not learn from our own professor. This just gives me a lot of hope.

[@37no37]

PLEASE, somebody can tell me, the first video of this, so going to be possible to know what he is talking about, tell me any ordinary level text book, so I can go by baby steps.

[@Dr_Adam]

N=1 so P=P problem solved. :)

[@ThrowFence]

@faready what, no..? should I understand it?

[@SalfaMusic]

@SalfaMusic thats using computer science as an example

[@SalfaMusic]

@tarrizzzzzzzzz Basically if you solved p = np, you would prove that questions that can be solved quickly can be verified quickly. now when i say quickly i mean polynomial time of course.

[@Mrdresden]

Where I say NP first it should be NPC. And I'll add that to this day no conclusive evidence has been found that disproves nor proves the theory, and enormous amounts of time and effort by great CS and mathematicians has been put into the problem.

[@Anonymouzee]

please use IIF for instead of IFF (fuzzy result)

[@therealxunil2]

***** No

[@SalfaMusic]

@snakeMLT well maybe if they added editing to youtube comments!

[@ericarogers555]

Problem = No Problem

[@ThrowFence]

@SalfaMusic well then, please explain it in short and easy terms to me :)

[@snakeMLT]

@SalfaMusic Replying to yourself. SO HARDCORE :O.

[@HylianEvil]

P is in NP though.

[@newtonisaacma]

NP=no problem

[@SalfaMusic]

@tarrizzzzzzzzz haha yeah probably. im 17, i get this.

[@markquigley5709]

If human thought is NP - complete, then P = NP ...

[@spechtbert]

NP = P umad now

[@Hajjat]

Dat hair hahaha...