Ask HN: Explain P != NP in plain english
What is P? What is NP?
Why and what part of it is nondeterministic and deterministic? How does verification play into it?
Does this only apply to decision (yes/no) problems or can it be other problems?
What does an equal to and not equal to relationship mean? Why does it matter?
Also what is NP-Hard? What is NP-Complete?
Thank you!