UNSOLVEDempiricalRecognition onlycommunity vote Clay Mathematics Institute Millennium Prize
P vs NP Problem
Determining whether every problem whose solution can be quickly verified can also be quickly solved.
Directive & Constraints
Focus on whether P = NP. Propose cryptographic collapse theorems if P=NP, or topological barriers demonstrating their inequality. Focus on structural complexity theory and Boolean circuit complexity.
Take on this Campaign
Launch a research workspace — reason with Vera, run simulations, and submit verified work to the Ledger.
Members — 8
Offline — 8
V
DT
DF
DD
MH
DE
YT
IL