CURATED OPEN QUESTION
written by a person · artifact 2026-07-27/v2-bridge-k5 · SHA-256 73847f8ff535e7d2…P versus NP
Whether every problem whose solution can be verified quickly can also be solved quickly. Formalised in 1971. The answer determines whether large parts of cryptography rest on genuine hardness or on an unproven assumption.
- posed
- 1971
This is a sourced, human-curated entry or a declared project limitation. It is not a computed discovery or an actionable hypothesis.