OpenComputer Science·1971
P vs NP
Asks whether every efficiently verifiable solution can also be efficiently found.
P vs NP is the central problem of computational complexity. A proof would reshape cryptography, optimization, proof search, and the theoretical limits of computation.
Summary
P vs NP is the central problem of computational complexity. A proof would reshape cryptography, optimization, proof search, and the theoretical limits of computation.