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.

▶︎
17. Complexity: Approximation Algorithms

▶︎
8. NP-Hard and NP-Complete Problems

▶︎
R9. Approximation Algorithms: Traveling Salesman Problem

▶︎
Biggest Puzzle in Computer Science: P vs. NP

▶︎
MIT Godel Escher Bach Lecture 1

▶︎
The Professor Who Taught People How To Think (1962)

▶︎
16. Complexity: P, NP, NP-completeness, Reductions

▶︎
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

▶︎
P vs. NP - The Biggest Unsolved Problem in Computer Science

▶︎
Dr. V.A. Shiva Ayyadurai at IIT, Delhi

▶︎
What Computers Can't Do - with Kevin Buzzard

▶︎
Terence Tao - Machine assistance and the future of research mathematics - IPAM at UCLA

▶︎
R8. NP-Complete Problems

▶︎
Professor Avi Wigderson on the "P vs. NP" problem

▶︎
Lisa Su Address to MIT Class of 2026

▶︎
We're 99.9% sure this pattern is true, but no one can prove it

▶︎
P vs. NP - An Introduction

▶︎
How to Speak

▶︎
P vs. NP by Sammy Mehra

▶︎
