Open problemEditorial · Complexity theory
P versus NP
Determine whether : can every decision problem whose solutions are verifiable in polynomial time also be solved in polynomial time?
Source checked Jul 24, 20261 pinned Lean statementInspect problem