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 157

Graph-Based Deterministic Polynomial Framwork for NP Problems

A post-2016 Register census entry for a claimed P = NP result by Changryeol Lee. 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.

No refutation is recorded in the census data. Absence of a located response is not evidence that none exists.

Register census note

Inclusion basis

The abstract explicitly states that the construction resolves the question and demonstrates P=NP.

Post-2016 census provenance

Discovery queries

  • arXiv all:"P=NP" + proof language
  • arXiv abs:"resolving the P vs NP"

Cite this dossier

Plain text

The P versus NP Register. “Dossier 157: Graph-Based Deterministic Polynomial Framwork for NP Problems.” Post-2016 Register census entry; as of 26 July 2026.

BibTeX

@misc{pvnp-register-157-2026,
  author = {{The P versus NP Register}},
  title = {Graph-Based Deterministic Polynomial Framwork for NP Problems},
  year = {2026},
  note = {Post-2016 census dossier 157; unadjudicated; as of 2026-07-26}
}