P vs. NP and the Computational Complexity Zoo
hackerdashery · 10:44 · Watch on YouTube
P vs. NP asks whether being able to quickly check a solution also means there is a quick way to find it, and most researchers suspect the answer is no, which would explain why puzzles like Sudoku, protein folding, and...