Тёмный

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

Living Science
Подписаться 15 тыс.
Просмотров 49 тыс.
50% 1

Опубликовано:

 

30 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 41   
@ritik84629
@ritik84629 5 лет назад
I love bright students listening to him
@drsmahesan203
@drsmahesan203 3 года назад
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
@gauravsethi8517 6 лет назад
Great to watch wonderful professor also appreciate living science
@robinsir
@robinsir 11 месяцев назад
No doubt Naveen Sir is an excellent professor.
@KumaresanMuruganandam
@KumaresanMuruganandam 4 года назад
He still is the same teacher. The second student in blue T-Shirt had a point.
@ojjasvijain8773
@ojjasvijain8773 4 года назад
Amazing teaching style.....pls upload more videos on algorithm.....thank u sir giving us your valuable time....
@curiousmedium4701
@curiousmedium4701 3 года назад
could not believe the professor became old. I was having picture of him teaching the DS in youtube
@gatelectures5289
@gatelectures5289 4 года назад
teaching methodology is awesome
@lakkireddypradeepkumarredd6344
@lakkireddypradeepkumarredd6344 4 года назад
Where can I find hi slectures other than IIT Delhi(nptel)
@artattraction8728
@artattraction8728 6 лет назад
amazing lecture :) sir please upload more on algorithms thankyou
@skittles6486
@skittles6486 5 лет назад
Very nice explanation. Please upload more videos on Approximation algorithms and FPT algorithms.
@MikiSiguriči1389
@MikiSiguriči1389 2 года назад
good teacher nice lecture, wish you all the best, greetings from Serbia
@kuldeepadhikari3849
@kuldeepadhikari3849 6 лет назад
are his lectures on algorithms available ? i mean new ones ? .. more like advanced Algo lectures ..
@asifbhat3796
@asifbhat3796 5 лет назад
I wish my teachers are like u
@parthi2929
@parthi2929 5 лет назад
PLEASE KEEP BOTH BOARD AND PROF IN FOCUS.. SET MAX APERTURE! ITS DISTRACTING!
@AMITKUMAR-rk5sq
@AMITKUMAR-rk5sq 6 лет назад
What is the field I need to get in at IIT-D to study this subject from him?
@kritik7795
@kritik7795 6 лет назад
AMIT KUMAR He teaches Computer Science to students.
@vivekkumardubey2327
@vivekkumardubey2327 6 лет назад
Great teaching .
@arnabkumardas214
@arnabkumardas214 6 лет назад
can any body say what is approximation we are making for vertex cover problem?
@priyankmungra29
@priyankmungra29 4 года назад
Wooooow❤❤❤. Great explanation. Is there any platform where I can get other lectures of him?
@Lc-yk2rl
@Lc-yk2rl 3 года назад
Nptel site
@meerapandey8649
@meerapandey8649 4 года назад
Ausum prof. Love u alot pranam
@adityapandey5264
@adityapandey5264 7 лет назад
Thank you, very helpful.
@livingscience7152
@livingscience7152 7 лет назад
Thank for your appreciation. If it helps you can also watch QnA session with Prof. Garg ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-hhEx2zNFPAk.html
@deepak9365
@deepak9365 6 лет назад
Where I found data structures lecture
@c.danielpremkumar8495
@c.danielpremkumar8495 6 лет назад
What is the significance of the additional vertical lines when you write 'P' and 'NP' ?
@amritkumar7488
@amritkumar7488 3 года назад
Nothing special. It's a way of writing mathematical sets called blackboard bold.
@The_Seeker_of_Truth1984
@The_Seeker_of_Truth1984 7 лет назад
wonderful.
@livingscience7152
@livingscience7152 7 лет назад
Thank you for appreciation !
@ishtiyaqnazirishtiyaqnazir4881
Thanks
@modhialjashaam4479
@modhialjashaam4479 6 лет назад
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
@deepak9365
@deepak9365 6 лет назад
Sir I want more lecture on algorithms
@dharitribhuyan6770
@dharitribhuyan6770 4 года назад
🙇‍♂️🙏
@shivamkumar-ft3tx
@shivamkumar-ft3tx 5 лет назад
respectfull.teaccher.
@shivendrayadav9704
@shivendrayadav9704 6 лет назад
please upload more videos of daa
@livingscience7152
@livingscience7152 6 лет назад
Thank you for your comment. You can also watch QnA session with Dr Garg ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-LgYPnYHJ-pk.html and more on www.livingscience.in
@vikrant4666
@vikrant4666 6 лет назад
i study i mit , and ur lecture was kinda a helpful thanks sir
@MarufShaikhTG
@MarufShaikhTG 6 лет назад
bs
@sourabhkhandelwal1568
@sourabhkhandelwal1568 5 лет назад
Studies in MIT but doesn't know how to construct a simple sentence. Fake attention seeker.
@romzi8157
@romzi8157 6 лет назад
Number of particles in the universe is between 10^72 to 10^87
Далее
8. NP-Hard and NP-Complete Problems
31:53
Просмотров 1,9 млн
NP-complete problems: Samuel's tutorial
27:27
16. Complexity: P, NP, NP-completeness, Reductions
1:25:25
Beyond Computation: The P vs NP Problem - Michael Sipser
1:01:38
General Talk by HC Verma
1:11:54
Просмотров 3,3 млн
Dr. V.A. Shiva Ayyadurai at IIT, Delhi
1:01:01
Просмотров 10 тыс.
The Satisfiability Problem, and SAT is in NP
10:54
Просмотров 49 тыс.
Sustainability and Inclusivity: Dr Harish Hande
48:03
Просмотров 3,2 тыс.
19. Complexity
59:09
Просмотров 28 тыс.
Lecture 23: Computational Complexity
51:12
Просмотров 523 тыс.