P vs NP problem
unsolved problem in computer science about time complexity
Build a research pod on P vs NP problem.
6 expert discussions. Save them all to your own pod, ask any question, get cited answers.
Common Themes
Videos Mentioning P vs NP problem
Po-Shen Loh: Mathematics, Math Olympiad, Combinatorics & Contact Tracing | Lex Fridman Podcast #183
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.
Donald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62
Lex Fridman
A fundamental open problem in theoretical computer science, concerning whether every decision problem for which an answer can be quickly verified can also be quickly solved; Knuth intuitively believes P may equal NP but that a proof would not directly lead to practical algorithms due to the vastness of possible algorithms.
Brian Kernighan: UNIX, C, AWK, AMPL, and Go Programming | Lex Fridman Podcast #109
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.
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
Lex Fridman
A major unsolved problem in computer science asking whether every problem whose solution can be quickly verified can also be quickly solved; considered a 'meta problem' with wide ripple effects.
AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503
Lex Fridman
A major unsolved problem in theoretical computer science, asking whether every problem whose solution can be quickly verified can also be quickly solved.
Brendan Eich: JavaScript, Firefox, Mozilla, and Brave | Lex Fridman Podcast #160
Lex Fridman
A major unsolved problem in theoretical computer science, which Eich acknowledges as interesting but not very useful in practice due to practical engineering focus.