Historical dossier 006

A polynomial time (heuristic) SAT algorithm

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

Dossier: 006
Author(s): Charles Sauerbier
Date recorded: May 2002
Direction: P = NP
Works or versions: 1
Adjudication: Recorded
Seed source: sources/captures/woeginger-list-frozen-2016.html
Source selector: ol > li:nth-of-type(6)

Woeginger’s note — verbatim historical text

Verbatim historical text

[Equal]: In May 2002 Charles Sauerbier designed a polynomial time algorithm for the satisfiability problem. This algorithm employs an unconventional approach premised on set theory (which does not use search or resolution) to partition the set of all assignments into nonsatisfying and satisfying assignments. The paper "A polynomial time (heuristic) SAT algorithm" can be found at the "arXiv.org e-Print archive". In September 2003, a hole has been found in the algorithm: An eleventh hour change admits a path inconsistency. The inconsistency arises due to an improper closure of a path to a cycle against a root not supportive of the path. The mathematical basis of the algorithm remains supportive of the intended solution, and a revision of the algorithm is underway.

Preserved from the frozen 2016 page. This is the historical layer, not the Register’s voice.

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

Cite this dossier

Plain text

The P versus NP Register. “Dossier 006: A polynomial time (heuristic) SAT algorithm.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-006-2026,
  author = {{The P versus NP Register}},
  title = {A polynomial time (heuristic) SAT algorithm},
  year = {2026},
  note = {Dossier 006; as of 2026-07-24}
}

Event timeline

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