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 149

An alleged polynomial-time algorithm for subgraph isomorphism implying P=NP

A post-2016 Register census entry for a claimed P = NP result by Zikang Deng. 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 derives P=NP from the proposed algorithm; the public critique is attached to the lineage.

Post-2016 census provenance

Discovery queries

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

Cite this dossier

Plain text

The P versus NP Register. “Dossier 149: An alleged polynomial-time algorithm for subgraph isomorphism implying P=NP.” Post-2016 Register census entry; as of 26 July 2026.

BibTeX

@misc{pvnp-register-149-2026,
  author = {{The P versus NP Register}},
  title = {An alleged polynomial-time algorithm for subgraph isomorphism implying P=NP},
  year = {2026},
  note = {Post-2016 census dossier 149; unadjudicated; as of 2026-07-26}
}