P versus NP problem
A major unsolved problem in theoretical computer science concerning whether every problem whose solution can be quickly verified can also be quickly solved.
Videos Mentioning P versus NP problem
Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72
Lex Fridman
A major unsolved problem in theoretical computer science, asking whether every problem whose solution can be quickly verified can also be quickly found.
Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Lex Fridman
A major unsolved problem in theoretical computer science concerning whether every problem whose solution can be quickly verified can also be quickly solved.
Cal Newport: Deep Work, Focus, Productivity, Email, and Social Media | Lex Fridman Podcast #166
Lex Fridman
A major unsolved problem in theoretical computer science, concerning whether every problem whose solution can be quickly verified can also be quickly solved; most complexity theorists believe P does not equal NP.
Stephen Wolfram: Fundamental Theory of Physics, Life, and the Universe | Lex Fridman Podcast #124
Lex Fridman
A major unsolved problem in theoretical computer science, asking whether every problem whose solution can be quickly verified (NP) can also be quickly solved (P).