Home
Sign in to join
Campaign openReview workflow: community reviewRecognition onlyRecognition rule: community 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

Open a research workspace to reason with Vera and prepare evidence for this campaign's Ledger.