P versus NP problem

Concept

A major unsolved problem in theoretical computer science concerning whether every problem whose solution can be quickly verified can also be quickly solved.

Mentioned in 2 videos

Videos Mentioning P versus NP problem

Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72

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

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.