Est. 1996 · Maintained again since 2026

The P versus NP Register

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

Historical dossier 075

Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields

A recorded P = NP claim by Matt Groff, 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 075: Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-075-2026,
  author = {{The P versus NP Register}},
  title = {Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields},
  year = {2026},
  note = {Dossier 075; as of 2026-07-24}
}

Event timeline

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