Proving CLIQUE is NP-Complete

[@anandseetharam]

I also blog on Medium medium.com/@seetharam.anand. I write on data science, AI, machine learning and computer science in general. Please FOLLOW me on Medium for more articles.I also provide FREE courses on Udemy on these topics www.udemy.com/user/anand-seetharam/. Check it out!

[@shreyas1517]

Crystal clear explanation in all the videos throughout this series. Really helpful!

[@anandseetharam]

Thank you

[@cmac1600]

Thank you so much for your videos. You explain this perfectly for me.

[@yousufahmed985]

bro you the real G

[@davidlancaster5804]

Good job explaining it simply. Turning up the audio would be good.

[@zequnchen1107]

hello sir, thanks for your so clear explanation , i am wondering if i can sharer your video in a Chinese's website named "bilibili", cuz there are few of the videos explain NP question and they explained so complex .

[@anisham568]

Thank you for the video, sir. Really helpful.

[@anandseetharam]

You are welcome

[@mike_o7874]

You explain very well thanks a lot 😁

[@saminyaser1913]

I think, there might be a mistake on the clique graph construction from 3-CNF. If we take where the second number refers to this node to be a literal of 1st clause. Then, it should have edges with , , , and by definition. But, in the above graph edge is missing. A similar phenomenon can be seen in other nodes too.

[@shobapandian]

Yes even i noticed that....

[@shobapandian]

May be there are some other conditions which we should take into consideration