Historical dossier 033

A Polynomial Time Algorithm for The Traveling Salesman Problem

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

Dossier: 033
Author(s): Sergey Gubin
Date recorded: October 2006
Direction: P = NP
Works or versions: 3
Adjudication: Recorded
Seed source: sources/captures/woeginger-list-frozen-2016.html
Source selector: ol > li:nth-of-type(33)

Woeginger’s note — verbatim historical text

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/cs.DM/0610042
200 · Link status checked 24 July 2026.
Link printed in the historical dossier
Live
http://arxiv.org/abs/0704.0514
200 · Link status checked 24 July 2026.
Link printed in the historical dossier
Live
http://arxiv.org/abs/0804.2699
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 033: A Polynomial Time Algorithm for The Traveling Salesman Problem.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-033-2026,
  author = {{The P versus NP Register}},
  title = {A Polynomial Time Algorithm for The Traveling Salesman Problem},
  year = {2026},
  note = {Dossier 033; as of 2026-07-24}
}

Event timeline

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