Corroboration · Est. 1996, maintained again since 2026

The P versus NP Register

Continuing the page kept by Gerhard Woeginger, 1996–2016.

Post-2016 Register census entry 136

A polynomial time algorithm for 3-SAT

A post-2016 Register census entry for a claimed P = NP result by Manoj Kumar. It was not part of Woeginger’s frozen list and remains an unadjudicated candidate.

Candidate status

Unadjudicated candidate

Unadjudicated

The Register publishes this census record without endorsing or adjudicating the mathematical claim.

Unadjudicated does not mean endorsed.

A refutation is recorded in the census evidence below. This records a public response, correction, or withdrawal; it is not a Register adjudication.

Register census note

Inclusion basis

The abstract explicitly states that the algorithm proves P=NP; the public complexity analysis is attached to the lineage.

Post-2016 census provenance

Discovery queries

  • arXiv abs:"we prove that P=NP"
  • arXiv all:"P=NP" + polynomial algorithm

Cite this dossier

Plain text

The P versus NP Register. “Dossier 136: A polynomial time algorithm for 3-SAT.” Post-2016 Register census entry; as of 26 July 2026.

BibTeX

@misc{pvnp-register-136-2026,
  author = {{The P versus NP Register}},
  title = {A polynomial time algorithm for 3-SAT},
  year = {2026},
  note = {Post-2016 census dossier 136; unadjudicated; as of 2026-07-26}
}