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!!!
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.
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.
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 .
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.
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
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.
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.
For years I never understood what NP hard was or NP complete was until I watch this video it is crystal clear and also the conversion between satisfiability and NP hard is perfectly clear now
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.
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.
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
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.
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.
One of the best lecture on this topic on TH-cam.. 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 )
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?
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.
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.
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 ?
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
that's awesome, which video did he say that in
@@studyhelpandtipskhiyabarre1518 he said that on np-hard and np-complete video
9
🎉😅
its not that deep lil bro
@@aadiamitringay3032 Bet you finally felt like a man after saying that
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!!!
Same for me man
@@roshinroy5129 sama for me
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.
This man is singlehandedly saving my CS degree
so true
Please also watch the lectures of Dr.Khaleel Khan sir , the God of O.S and Algorithms .
He is teaching better with logic than my college professor. Hats off sir!
Dei neena🥴
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.
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 .
SIR , I JUST WANT TO BOW DOWN TO YOU.
EVERYTHING IS CRYSTAL CLEAR TO ME WHEN YOU TEACH. SIMPLY OUTSTANDING!!!!!!
God Bless You, Dear.
Finding good information and videos on NP is so hard, thank you so much for this helpful, quality content!
Understanding NP-Hard is NP-Hard
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.
One and only saviour before the semester exam.
A lot of thanks to sir on behalf of all the students' community. ❤
Thankyou sir! I finally understood SAT reduction to Clique problem in one go. You are brilliant at explaining!
I watched so many videos abt cliques, this is the only one explained cliques and np prob clearly. Thank you so much
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
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.
Would love to see more lectures on such problems! Nicely explained!
That was very clear, sir. I don't know how I've never bumped into your great lectures. Thanks
Best algorithm prof on youtube. I feel more confident after watching your videos
This is an excellent lecture on this topic. Not many TH-cam videos cover this subject. Thank you, Sir.
Your lectures are simply outstanding!!
Tommorow is my DAA mid exams and you are saving me from getting failed. Hahaha. 💜
Amazing, would not have been able to complete it reading in books a day before exam
Helped a lot :-)
Thank you sir
He literally made my college education free. Damn!
Abdul is the man. He is keeping me interested in CS and discrete mathematics.
Sir your videos are very clean, straight to the point and easy to understand. Thank you ;)
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.
Sir.....!!! Great explanation......you blew our mind with the proofs....🥳
Thank you sir for making me to understand difference between P,NP,NP Hard and NP Complete problems with such an easiness
This man is an international treasure. Protect him at all costs!
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😊🙌🏻
Sir, your method of teaching is really really accurate and nice. Got to understand by watching just once. Thank you very much.
I myself am a teacher . Your videos are awesome. I always see your videos while teaching.
His easy approach made me write this comment..
This guy is awesome❤❤
Abdul sir never disappoint us :)
you are great teacher. From yesterday, I tried to solution my homework but I couldn't. Now I understand. Thank you very very much
I am Stanford University student and I am learning from this legend . Hatsoff to you !!
For years I never understood what NP hard was or NP complete was until I watch this video it is crystal clear and also the conversion between satisfiability and NP hard is perfectly clear now
The video really disambiguated the concepts. Thank you very much sir for efforts.
Thank you Abdul Bari, you save my final exam!!!
sir you teaches much better than my ivy school teacher
Your videos are a saviour for us students. A must watch for exam and gate preparations
No words can describe my gratitude to you
May God bless u sir, stay Happy, stay healthy, we want more videos from u to make life a bit easier❤️
till now the best vedios i have seen sir...keep doing and keep helping us like this
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.
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.
could not understand this video... previous video was much helpful. by the way, all other videos were much helpful. thank you.
Hello sir! Your teaching skill is very best👍👍👍👍👌👌👍👍
You have made this difficult topic easy to understand, Thanks
Very good explanation on NP Hard and NP Complete and what it is, i got some idea into mind of what it is now.
Very very nice sir i am very happy today i learnt after long effort because i am not a student of maths
You are the best one Sir .. Great Professor ever ..
Sir ,your explanation is soo clear.it really helping us a lot...
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
Thank you very much sir, superior explanation and pace
best explanation ABDUL BARI Sir . Thank you
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.
Excellent teaching sir. I am forever grateful to you.
This was a really outstanding explanation. Thanks!
Very clear explanation, hats off to you sir!
Excellent! Thank you for the explanation! Best regards from Brazil :)
Sir, you solved my long pending problem
Ur videos are helpful.. nice explain everypoint uu explain in detail..
THANK YOU SO MUCH!!
Very clear, to the point explanation. Happy to find a good teacher on TH-cam :)
Sir your videos are easy to understand....
Thank you sir ! Your videos really helped a lot !
U r really great sir lots of respect sir ☺
Thank you for helping my exam!
Nicely discussed a difficult problem..
why did i find this playlist just one night before my final exam
Could you make more videos about np problems? These are very helpful!
Hi
better than hours of lecture
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.
This guy is a King.
A very helpful video...excellent explanation..thanks so much sir
THANK YOU SO MUCHHH, YOU REALLY SAVE MEEEEE
This man is incarnation of God
#Respect
Fabulous explanation sir lot of respect 🙏👍🙏👍🙏🙏👍🙏👍🙏👍🙏🙏👍🙏👍🙏🙏👍🙏👍salute to you sir 🙋♀🙋♀🙋♀🙋♀🙋♀🙋♀🙏🙏👍
sir what is i take and example with a single clause
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
salute to you sir thank you so much!! best professor sir!
NP-hard CDP proof starts from 6:43
thnq so mch sir you made it look so easy thnx a lot
Vedio is very beautifully explained.. Thanks for the vedio.
2-SAT problem is in P then how can it be used to prove clique as NP hard?
Exactly. I also wrote it in comment.
you're the reason imma pass my algorithms final
One of the best lecture on this topic on TH-cam.. 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 )
@@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...
@@abdul_bari so swt.... Thanks sir...
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?
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.
Very nice, Sir Bari.
Thanks a lot.
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.
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.
Thank you very much for your clear explanation.
Thanku sir . . i hope that , i can defenetily write this ,in my answer sheet , tomorrow ,, 😘
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 ?
Sir what is vertex cover problem? Are Clique and Vertex cover problem same?
Nice explanation 👌👌👌
Clear and just made simple. Thanks
Amazing Explanation Sir!
Thank you so much for the video. Clearly explained
Sir very nicely explanation sir......more videos on data structures in cpp sir