Historical dossier 019

A Polynomial-time Exact Algorithm for the Subset Sum Problem

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

Dossier: 019
Author(s): Andrea Bianchini
Date recorded: January 2005
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(19)

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://es-andreabianchini.it/ssp_eng.pdf
200 · Link status checked 24 July 2026.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 019: A Polynomial-time Exact Algorithm for the Subset Sum Problem.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-019-2026,
  author = {{The P versus NP Register}},
  title = {A Polynomial-time Exact Algorithm for the Subset Sum Problem},
  year = {2026},
  note = {Dossier 019; as of 2026-07-24}
}

Event timeline

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