NP Completeness 8 - Vertex Cover Problem

In this video we introduce the Vertex Cover problem and prove that it is NP Complete by reducing the Independent Set problem to it.

[@throwawaycringeaccountfrom1898]

This is an incredible explanation. Keep doing what you're doing there's not a whole lot of videos on NP stuff!

[@jeviwaugh9791]

This is easier than reducing from 3-SAT. Using the independent set is more relevant than 3-SAT in this case.
Cheers Mate.

[@harshilrami5221]

thank you it was amazing.

[@noraht4967]

Thank you