NP reduction: vertex cover, k clique and independent set are all NP complete

Save
3 years ago
5

NP reduction: vertex cover, k clique, and independent set are all NP-complete

In this video, I can two proofs showing
vertex cover, k clique, and independent set are all NP-complete

Donate to Channel(斗內一下): https://paypal.me/kuoenjui
Facebook: https://www.facebook.com/mathenjui
Instagram: https://www.instagram.com/mathphyen/

0:00 start
8:00 from vertex cover to the independent set
13:00 from independent set to the k-clique
18:00 from 3sat to the k-clique
23:00 from 3col to independent set

Theoretical Computer science (TCS): https://www.youtube.com/playlist?list=PLg9w7tItBlZujE3RVc_7A5MaBMAWzcQjJ

Loading comments...