List Mode
1 / 1
Watch on YouTube
P versus NP
↑↓to move·?shortcuts
▲ 44💬 16
The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.
Loading comments…