What is NP complete? How to prove if a problem is NP complete?

Answer 1

A quick demystifier on P/NP/NPH/NPC problems:
https://en.m.wikipedia.org/wiki/NP-hardness#NP-naming_convention

Answer 2

"NP" is also online slang, an acronym for "No Problem", people (self included) often reply, "NP :)" when thanked.

#disambiguation #lol #factoid #NP

Answer 3

Usually the way you prove NP-completeness is to find a reduction to a problem that you already know is NP-complete (SAT, travelling salesman, ...)

Answer 4

Thank you!

Answer 5

Yes exactly. This is what Prof has written in lecture notes. HCP, TSP