Graph coloring
Kent Quanrud · 44:08
NP-complete problems are those that are both in NP (yes-instances have a polynomial-time checkable witness) and NP-hard (a polynomial algorithm for one would give a polynomial algorithm for every problem in NP); this...