8.1 NP-Hard Graph Problem - Clique Decision Problem

[@dhankumari7290]

When we don't know how the things are working we call it is magic Once we know how it is working it becomes technique / Logic ~ Abdul Bari

[@studyhelpandtipskhiyabarre1518]

that's awesome, which video did he say that in

[@god_gaming178]

@@studyhelpandtipskhiyabarre1518 he said that on np-hard and np-complete video

[@veenapal7849]

9 🎉😅

[@aadiamitringay3032]

its not that deep lil bro

[@JoshuaBharathi-rz7ry]

@@aadiamitringay3032 Bet you finally felt like a man after saying that

[@ritubanerjee5061]

Sir I was planning to leave this topic for my exam, but after watching your video, I have decided otherwise. Lots of respect to you Sir! Your lectures are simply outstanding!!!

[@roshinroy5129]

Same for me man

[@amritrajawat3083]

@@roshinroy5129 sama for me

[@ankitdubey9256]

The first time I am writing a review on any channel, but really I love to take lectures from you. The way you tell any topic is just amazing. Thank You Abdul sir.

[@taaaaaaay]

This man is singlehandedly saving my CS degree

[@swatisinghmar702]

so true

[@anshumansamanta5632]

Please also watch the lectures of Dr.Khaleel Khan sir , the God of O.S and Algorithms .

[@jeswintobias8251]

He is teaching better with logic than my college professor. Hats off sir!

[@dr.blastboi1315]

Dei neena🥴

[@INNOVATIVEAPPROACH]

sir , i have ssen this vedios only once and its awesome and very helpful as I understand it in one go . Your way to descibe the nitty gritty of CDP is very well .!!! I cannot resist to write a thanks to you .

[@MrDarkStar974]

Thanks a lot sir ! I'm a french student of computer science and i had to demonstrate the NP-Completeness of CDP. Without your help it would have been a lot more complicated. Especially since there's hardly any help in French for this demonstration.

[@akshayganji7412]

I feel these series are the best on Algorithms. I have binge watched most of your videos and they are so easy and straightforward to understand. Even my Professor with a PhD can't explain this well and confuses things beyond imagination. Kudos to you Sir! And thank you very much for this.

[@priya28881]

SIR , I JUST WANT TO BOW DOWN TO YOU. EVERYTHING IS CRYSTAL CLEAR TO ME WHEN YOU TEACH. SIMPLY OUTSTANDING!!!!!!

[@abdul_bari]

God Bless You, Dear.

[@DevSecNetLabs]

One and only saviour before the semester exam. A lot of thanks to sir on behalf of all the students' community. ❤

[@frozenjellyfish6114]

I watched so many videos abt cliques, this is the only one explained cliques and np prob clearly. Thank you so much

[@JC-cu2ym]

Thankyou sir! I finally understood SAT reduction to Clique problem in one go. You are brilliant at explaining!

[@rakeshkumaranjani4988]

your way of teaching is very simple and you sir deliver a high quality education on this platform. Thank you sir You are great doing for students of india and all over globe also

[@alexwenstrup5202]

Finding good information and videos on NP is so hard, thank you so much for this helpful, quality content!

[@YehiaAbdelmohsen]

Understanding NP-Hard is NP-Hard

[@sabrinanastasi5809]

Thank you one million times for this video. It's like no words to express how much you have the gift of breaking down complex topics into smaller easy ways to explain. Thank you.

[@sampadkar19]

This is an excellent lecture on this topic. Not many KZbin videos cover this subject. Thank you, Sir.

[@babithap4738]

Thank you sir for making me to understand difference between P,NP,NP Hard and NP Complete problems with such an easiness

[@dparikh1000]

Abdul is the man. He is keeping me interested in CS and discrete mathematics.

[@vishalsharma-bd3uj]

Dear sir i have learn lots from you and i think you are the best teacher on that platform to explain all the hard concept easily. Now i am requesting to you please make a video on proof of np complete problem also.

[@supriyacse-bg7978]

Your lectures are simply outstanding!!

[@NOOR-dy6yn]

Abdul sir never disappoint us :)

[@pauljones9150]

Best algorithm prof on youtube. I feel more confident after watching your videos

[@chrisogonas]

That was very clear, sir. I don't know how I've never bumped into your great lectures. Thanks

[@sohamchakrabarti2713]

He literally made my college education free. Damn!

[@Klausx007]

Tommorow is my DAA mid exams and you are saving me from getting failed. Hahaha. 💜

[@PalePinkThink]

This man is an international treasure. Protect him at all costs!

[@leedai4492]

sir you teaches much better than my ivy school teacher

[@siddhibudhale4352]

Sir, your method of teaching is really really accurate and nice. Got to understand by watching just once. Thank you very much.

[@rajsharma-bd3sl]

I am Stanford University student and I am learning from this legend . Hatsoff to you !!

[@cuteDali]

you are great teacher. From yesterday, I tried to solution my homework but I couldn't. Now I understand. Thank you very very much

[@xfactor2462]

I myself am a teacher . Your videos are awesome. I always see your videos while teaching.

[@joyone6031]

Thank you Abdul Bari, you save my final exam!!!

[@dheerajkafaltia8474]

Amazing, would not have been able to complete it reading in books a day before exam Helped a lot :-) Thank you sir

[@VegitoUltraI]

His easy approach made me write this comment.. This guy is awesome❤❤

[@atharvakaranje6538]

Would love to see more lectures on such problems! Nicely explained!

[@sid-jj6mq]

Sir, In future videos kindly move aside once at the end of video so that the whole board is visible. Its difficult to go back and front again to write the part of the board that u r cover for the entire video. Great video sir. Thankyou.

[@ridwanatolagbe3279]

The video really disambiguated the concepts. Thank you very much sir for efforts.

[@sahith2547]

Sir.....!!! Great explanation......you blew our mind with the proofs....🥳

[@gudiravisankar5164]

Very good explanation on NP Hard and NP Complete and what it is, i got some idea into mind of what it is now.

[@imalishahzadk]

could not understand this video... previous video was much helpful. by the way, all other videos were much helpful. thank you.

[@asaf4isr]

Great Video, the only thing that bothers me, the reduction done from 2-SAT, but, 2-SAT in P, i know the same construction you showed will work from 3 sat to clique neither. please explain.

[@kartikeyagupta651]

2-SAT problem is in P then how can it be used to prove clique as NP hard?

[@skittles6486]

Exactly. I also wrote it in comment.

[@yourSportss]

Very very nice sir i am very happy today i learnt after long effort because i am not a student of maths

[@priyeshkumar4814]

Sir your videos are very clean, straight to the point and easy to understand. Thank you ;)

[@anupamroy1455]

Sir your videos are very nice your explanations are crystal clear please try to upload more videos on data structures and algorithm with implementation in c it will be really helpful

[@michaeleluz9445]

No words can describe my gratitude to you

[@zishanahmad8248]

best explanation ABDUL BARI Sir . Thank you

[@mubashirmufti5941]

You have made this difficult topic easy to understand, Thanks

[@sounakbanik3087]

Your videos are a saviour for us students. A must watch for exam and gate preparations

[@khadi_1455]

why did i find this playlist just one night before my final exam

[@v.k.miruthula8559]

Excellent teaching sir. I am forever grateful to you.

[@rahulroy5206]

May God bless u sir, stay Happy, stay healthy, we want more videos from u to make life a bit easier❤️

[@vaishnaviakki8363]

Sir you are a super hero for me! Thank you so much,these videos helped a lot for my exams Keep making videos like these😊🙌🏻

[@himeshmishra5186]

I watched the MIT video on NP for 1hr::25min but didn't get a word but sir the way you have taught us it in 2 videos is commendable. This Indian Education System a peace of shit where University hires the incapable professor and make this Research topic like hell in which teacher like you sir saves us. Thanks a ton sir... Keep sharing the knowledge sir.

[@gbw4908]

Could you make more videos about np problems? These are very helpful!

[@SintuKumar-dg2qz]

Hi

[@challatejasree8336]

E = { ( , ) | i is not equal to j ; b is not equal to a’ }

[@AshutoshJha-k1l]

At 15:26 , we can also say that x2 is connected to x3 , by this logic i can give value of 1 to x1, but that will change the answer

[@muthierry1]

You are the best one Sir .. Great Professor ever ..

[@gamingbond1301]

NP-hard CDP proof starts from 6:43

[@oussamagacem4479]

You said on your previous video: to prove that a problem in an NP-Hard problem you need to prove that it can be reduced to SAT but what we are watching in this video you're doing the opposite, wich means you're reducing SAT to Clique decision problem. Any explanation?

[@gwynbleidd6080]

It's not about "how" the problem is getting reduced, but more about how do you establish a "similarity" between both the problems so that if a polynomial solution is brought about for one problem (let's say SAT), it can be reduced to bring about a polynomial solution to the other NP-hard problems.

[@Shortvideo-ru3sm]

Sir, you solved my long pending problem

[@florencenightingale9532]

Sir ,your explanation is soo clear.it really helping us a lot...

[@iangonzalez4309]

better than hours of lecture

[@Run2TheHorizon]

#suggestion "Clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete". Hence, a clique is not subgraph, rather a subset of vertices of a graph. Kindly, make the necessary correction. Thank you, for the video.

[@meerasolgama7324]

Hello sir! Your teaching skill is very best👍👍👍👍👌👌👍👍

[@ankan979]

Please make a video asap on proving vertex cover as np hard. No other youtuber is as good as you in making things understand to be honest.

[@harbaapkabaap2040]

2-SAT is not the correct example as it's polynomial time solvable. 3-SAT would have been a good reduction but that's a little involved.

[@anweshamitra4016]

till now the best vedios i have seen sir...keep doing and keep helping us like this

[@GanesanMNJRF-CSE]

Very clear explanation, hats off to you sir!

[@lijunxian3862]

Thank you for helping my exam!

[@sarveshkale8685]

Sir thank you skipping the writing part saved a lot of time and very nice explanation

[@vipingautam9852]

Sir you are amazing, i just want to touch your feet and show my respect to you :) whenever i get stuck i just search for you videos and i never get disappointed.

[@srinunaidu6581]

Sir your videos are easy to understand....

[@mehulshah4797]

Size of clique is 3 And 3CNF - SAT means each clause has 3 literals... But in the video there are only 2 literals in each clause.

[@mehulshah4797]

@@abdul_bari okay Thank you sir! Amazing videos 😄

[@hjain1011]

Sir you had made excellent videos. Thank you very much 😊. Can you further make a video about reduction of np complete problems. With some 5 reduction , that tree starting from satifiability to some famous problems.

[@c.danielpremkumar8495]

How does one decide the number of variables in each clause and number of clauses ? Also, within each clause, which variable(s) to be with a "Bar" (NOT) or normal.

[@jonahbartz1033]

@@abdul_bari If you had a 4 clauses with 5 variables in each clause then would the clique size still be 4(size of clauses)?

[@aronquemarr7434]

@@jonahbartz1033 Yes, it would.

[@mouniikaperam2394]

Ur videos are helpful.. nice explain everypoint uu explain in detail..

[@tesfayea.naramo6540]

thank you for your clear explanation but i need to know what if we are given 1000 clique is thin in Np? and how can i prove it ?

[@rishabhkumar2264]

thanks u making such nice tutorials.Can u make video on how to prove a problem is np complete or not??

[@kunalashtekar752]

Sir, please teach about how to prove that Clique is NP-Complete. Video contains solution upto NP-Hard

[@mantistoboggan537]

This was a really outstanding explanation. Thanks!

[@harsimranjeetsingh2693]

you're the reason imma pass my algorithms final

[@khadargori]

Please make proper daa subject playlist

[@markriad3910]

nice explanation , just a small questions : based on what u build the satisfiability formula ? is there guidelines to built the needed formula so we can have the correct relation to our corresponding problem ?

[@AryanGNU]

This man is incarnation of God #Respect

[@likhithareddy063]

pls do video on node cover decision problem how clique reduces ncdp

[@bhagyalaxmidhatrika2713]

Sir very nicely explanation sir......more videos on data structures in cpp sir

[@Manibabu60]

One of the best lecture on this topic on KZbin.. thanks sir .. One doubt is in my mind ?? At last you told that if it can be solved in polynomial time , then this can also be solved.. Actually i didn't get this point.. to whom problem u r refering to.. i mean for which u r assuming that it can be solved so other one can also be solved.. (i mean order )

[@Manibabu60]

@@abdul_bari okk sir .. thanks alot... Atleast i was not expecting that i will get reply within 10 minutes.. thanks alot sir.. u r grt...

[@Manibabu60]

@@abdul_bari so swt.... Thanks sir...

[@aliyafathima9634]

Sir if possible try to post a session on "Node Cover Decision Problem"

[@ramancheema20]

Sir ,Your videos are too good .Sir could you pls provide a video on countability and decidability as well

[@3394kash]

This guy is a King.

[@chinmaydas4053]

Nicely discussed a difficult problem..

[@dhanushgontla135]

I think there is a mistake (pls correct me if I am wrong) when L1 reduces to L2, it shows that if L2 is NP then L1 is also NP....but in the video @7:00 mr. Bari says " for proving L2 is np hard, we have to choose a problem L1 which we already know as np hard and show that L1 reduces to L2"

[@DevOpsGuy0]

Watch the video carefully.

[@dhanushgontla135]

@@DevOpsGuy0 yes, sorry. I misunderstood the argument.

[@DevOpsGuy0]

@@dhanushgontla135 okay.

[@adityakhera8470]

salute to you sir thank you so much!! best professor sir!

[@kirua_h]

Thank you sir ! Your videos really helped a lot !

[@nivedhahari4908]

A very helpful video...excellent explanation..thanks so much sir

[@zedoman5518]

U r really great sir lots of respect sir ☺

[@lmachado73]

Excellent! Thank you for the explanation! Best regards from Brazil :)

[@saimahumma4724]

Sir, please upload video on NP-Hard Scheduling Problem. My exam is on 29th May!

[@richadhiman585]

Vedio is very beautifully explained.. Thanks for the vedio.