P is not equal to NP.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
$\mathsf{P} \ne \mathsf{NP}$.
Assessment
Renown 5/5
The central problem of computer science; $1M Millennium Prize.
Attackability 0/5
A refutation is a polynomial-time SAT algorithm plus a correctness proof, not a finite object; known proof barriers (relativization, natural proofs, algebrization) fence every known route.
- finite witness
- 0/5
- oracle cost
- 0/5
- freshness
- 0/5
- seedability
- 0/5
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.