Np-Complete Problems | Is P = NP ?? | 3-Sat And 2-Sat Problem

[@anupkumarmridha7794]

Thank you sir till now whatever you try to teach in video is cleared Could you make video on Cook’s Theorem - Clique decision problem - Node cover problem - K-coloring problem.

[@rabia5619]

sir you are the best

[@ze-speeches]

Hello and thank you for the good video. Could you please explain, why a 3-SAT problem cannot be solved in polynomial time? Is it because we need to check 2^(3) possibilities? And how then a 2-SAT problem can be solved without checking 2^(2) possible cases? Also could you please explain, what it means to reduce a problem to another one? Thank you very much in advance. Pointing us to a resource would be absolutely enough.

[@radhikajaju3338]

thank you for this video

[@CodingBlocksIndia]

Our Pleasure

[@Akash-dd6ev]

Thanks a lot

[@CodingBlocksIndia]

Most welcome

[@shazam1334]

underrated

[@mohiychoithwani9549]

Where can I find the complete playlist of complexity classes??

[@amaldaagi5450]

give me an approximate satisfiability problem algorithm and thank you

[@subinoysikdar656]

prove tht 3sat problem is np compelete....u just told it...bt u didnt prove it

[@josueperez4333]

Why is 3sat np-complete thoe i mean why we cant do a dfs

[@arshadhussainsheikh5587]

Thoda or dire bol lete

[@ashishsinha8893]

Cooke. Theorem??

[@C.G.W]

man the voice is too low..

[@novagames5719]

Phone volume can be increased