Historical dossier 047

On the existence of polynomial-time algorithms to the subset sum problem

A recorded P ≠ NP claim by Jorma Jormakka, preserved from Woeginger’s frozen 2016 page.

Dossier: 047
Author(s): Jorma Jormakka
Date recorded: September 2008
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(47)

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/0809.4935
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 047: On the existence of polynomial-time algorithms to the subset sum problem.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-047-2026,
  author = {{The P versus NP Register}},
  title = {On the existence of polynomial-time algorithms to the subset sum problem},
  year = {2026},
  note = {Dossier 047; as of 2026-07-24}
}

Event timeline

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