The precise statements and locators cited in this P versus NP research record.
Source-reported preprint/project; independent mathematical assessment pending.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
Can every decision problem with polynomially bounded, polynomial-time-checkable certificates also be decided in deterministic polynomial time?
Replaces an earlier passage. View versioned records →
Passage ID: pnp-entry-general-status:v1
Source item: general-status
Source record: pnp-clay@observed-2026-10-10
Replaces passage: p-vs-np:entry:0:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v14
Source assessment
Open
Unsolved
The canonical classical uniform worst-case decision question P = NP; no supporting theorem decides this status.
Observed Oct 10, 2026
Recorded authorship
Clay Mathematics Institute
AI involvement is not reported by this cited source; this is not a claim of its absence.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Clay · P versus NP
Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.
Source terms ↗