Historical dossier 107

A Polynomial Time Algorithm For Solving Clique Problems

A recorded P = NP claim by Michael LaPlante, preserved from Woeginger’s frozen 2016 page.

Dossier: 107
Author(s): Michael LaPlante
Date recorded: March 2015
Direction: P = NP
Works or versions: 2
Adjudication: Recorded
Seed source: sources/captures/woeginger-list-frozen-2016.html
Source selector: ol > li:nth-of-type(107)

Woeginger’s note — verbatim historical text

Verbatim historical text

[Equal]: In March 2015, Michael LaPlante established P=NP by constructing a polynomial time algorithm for the maximum clique problem in a graph. The paper "A Polynomial Time Algorithm For Solving Clique Problems" is available at http://arxiv.org/abs/1503.04794. In April 2015, Hector A. Cardenas, Chester Holtz, Maria Janczak, Philip Meyers, Nathaniel S. Potrepka published a refutation of this approach. Their paper "A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami" is available at http://arxiv.org/abs/1504.06890. (Thanks to Santanu Bhowmick, Adam Kurpisz, Florian Sikora, Lane Hemaspaandra, and Kirk Pruhs and several others for providing these links.)

Preserved from the frozen 2016 page. This is the historical layer, not the Register’s voice.

Adjudication status

Adjudication recorded

Recorded

This historical dossier records an adjudication in Woeginger’s note. Follow the sources in that note for its basis. The Register has not re-judged it.

As of 24 July 2026

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.

Link printed in the historical dossier
Live
http://arxiv.org/abs/1503.04794
200 · Link status checked 24 July 2026.
Link printed in the historical dossier
Live
http://arxiv.org/abs/1504.06890
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 107: A Polynomial Time Algorithm For Solving Clique Problems.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-107-2026,
  author = {{The P versus NP Register}},
  title = {A Polynomial Time Algorithm For Solving Clique Problems},
  year = {2026},
  note = {Dossier 107; as of 2026-07-24}
}

Event timeline

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