Historical dossier 099

The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version)

A recorded P ≠ NP claim by Rustem Chingizovich Valeyev, preserved from Woeginger’s frozen 2016 page.

Dossier: 099
Author(s): Rustem Chingizovich Valeyev
Date recorded: August 2013
Direction: P ≠ NP
Works or versions: 1
Adjudication: Not recorded
Seed source: sources/captures/woeginger-list-frozen-2016.html
Source selector: ol > li:nth-of-type(99)

Woeginger’s note — verbatim historical text

Adjudication status

Unadjudicated

Unadjudicated

No adjudication is recorded in the imported historical dossier.

Unadjudicated does not mean endorsed.

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://www.idosi.org/wasj/wasj24%288%292013.htm
200 · Link status checked 24 July 2026.
Link printed in the historical dossier
Live
http://www.idosi.org/wasj/wasj24(8)13/16.pdf
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 099: The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version).” As of 24 July 2026.

BibTeX

@misc{pvnp-register-099-2026,
  author = {{The P versus NP Register}},
  title = {The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version)},
  year = {2026},
  note = {Dossier 099; as of 2026-07-24}
}

Event timeline

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