P, NP and Approximation Algorithms: Prof. Naveen Garg, IIT-Delhi

This is a short lecture on "The P versus NP problem" by Prof. Naveen Garg of Computer Science department at the IIT-Delhi. Here Prof. Garg clearly explains a very hard topic without the use of technical language or supporting proofs to non-computer science students. With such lecture series Living Science (www.livingscience.in) aims to increase enthusiasm among students for interdisciplinary areas of great importance.
This lecture was produced in collaboration with DST-Center for Policy Research at IIT-Delhi.

[@ritik84629]

I love bright students listening to him

[@drsmahesan203]

NP is the class of problems for which given solutions can be verified in polynomial time. With this definition, it is easy to perceive why P is a subset of NP.

[@gauravsethi8517]

Great to watch wonderful professor also appreciate living science

[@artattraction8728]

amazing lecture :)
sir please upload more on algorithms
thankyou

[@ojjasvijain8773]

Amazing teaching style.....pls upload more videos on algorithm.....thank u sir giving us your valuable time....

[@KumaresanMuruganandam]

He still is the same teacher. The second student in blue T-Shirt had a point.

[@gatelectures5289]

teaching methodology is awesome

[@robinsir]

No doubt Naveen Sir is an excellent professor.

[@skittles6486]

Very nice explanation. Please upload more videos on Approximation algorithms and FPT algorithms.

[@asifbhat3796]

I wish my teachers are like u

[@vivekkumardubey2327]

Great teaching .

[@curiousmedium4701]

could not believe the professor became old. I was having picture of him teaching the DS in youtube

[@kuldeepadhikari3849]

are his lectures on algorithms available ? i mean new ones ? .. more like advanced Algo lectures ..

[@adityapandey5264]

Thank you, very helpful.

[@livingscience7152]

Thank for your appreciation. If it helps you can also watch QnA session with Prof. Garg ua-cam.com/video/hhEx2zNFPAk/v-deo.html

[@meerapandey8649]

Ausum prof. Love u alot pranam

[@ishtiyaqnazirishtiyaqnazir4881]

Thanks

[@lukafarkas420]

good teacher nice lecture, wish you all the best, greetings from Serbia

[@The_Seeker_of_Truth1984]

wonderful.

[@livingscience7152]

Thank you for appreciation !

[@lakkireddypradeepkumarredd6344]

Where can I find hi slectures other than IIT Delhi(nptel)

[@arnabkumardas214]

can any body say what is approximation we are making for vertex cover problem?

[@deepak9365]

Sir I want more lecture on algorithms

[@deepak9365]

Where I found data structures lecture

[@parthi2929]

PLEASE KEEP BOTH BOARD AND PROF IN FOCUS.. SET MAX APERTURE! ITS DISTRACTING!

[@shivamkumar-ft3tx]

respectfull.teaccher.

[@dharitribhuyan6770]

🙇‍♂️🙏

[@c.danielpremkumar8495]

What is the significance of the additional vertical lines when you write 'P' and 'NP' ?

[@amritkumar7488]

Nothing special. It's a way of writing mathematical sets called blackboard bold.

[@priyankmungra29]

Wooooow❤❤❤. Great explanation. Is there any platform where I can get other lectures of him?

[@Lc-yk2rl]

Nptel site

[@modhialjashaam4479]

Greetings Professor .. I am an Iraqi PhD student I study in Malaysia and I need your help because I work with the same competence I can communicate with you ... with appreciation

[@AMITKUMAR-rk5sq]

What is the field I need to get in at IIT-D to study this subject from him?

[@kritik7795]

AMIT KUMAR
He teaches Computer Science to students.

[@shivendrayadav9704]

please upload more videos of daa

[@livingscience7152]

Thank you for your comment. You can also watch QnA session with Dr Garg ua-cam.com/video/LgYPnYHJ-pk/v-deo.html and more on www.livingscience.in

[@romzi8157]

Number of particles in the universe is between 10^72 to 10^87

[@vikrant4666]

i study i mit , and ur lecture was kinda a helpful thanks sir

[@MarufShaikhTG]

bs

[@sourabhkhandelwal1568]

Studies in MIT but doesn't know how to construct a simple sentence. Fake attention seeker.