Est. 1996 · Maintained again since 2026

The P versus NP Register

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

Historical dossier 071

The Complexity of 3SAT_N and the P versus NP Problem

A recorded P ≠ NP claim by Ruijia Liao, preserved from Woeginger’s frozen 2016 page.

Woeginger’s note — verbatim historical text

Adjudication status

Unadjudicated

Unadjudicated

No adjudication is recorded in the imported historical dossier.

Unadjudicated does not mean endorsed.

Links printed in the dossier

Link status checked against the held 24 July 2026 probe. A dead link does not change the claim’s status.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 071: The Complexity of 3SAT_N and the P versus NP Problem.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-071-2026,
  author = {{The P versus NP Register}},
  title = {The Complexity of 3SAT_N and the P versus NP Problem},
  year = {2026},
  note = {Dossier 071; as of 2026-07-24}
}

Event timeline

No post-seed events are recorded for this dossier. Its imported historical record remains unchanged.