Historical dossier 007

Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders

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

Dossier: 007
Author(s): Givi Bolotashvili
Date recorded: March 2003; 1990
Direction: P = NP
Works or versions: 2
Adjudication: Not recorded
Seed source: sources/captures/woeginger-list-frozen-2016.html
Source selector: ol > li:nth-of-type(7)

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://arxiv.org/abs/cs.CC/0303008
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 007: Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-007-2026,
  author = {{The P versus NP Register}},
  title = {Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders},
  year = {2026},
  note = {Dossier 007; as of 2026-07-24}
}

Event timeline

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