Historical dossier 049

A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem

A recorded P = NP claim by Zohreh O. Akbari, preserved from Woeginger’s frozen 2016 page.

Dossier: 049
Author(s): Zohreh O. Akbari
Date recorded: November 2008; 2013
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(49)

Woeginger’s note — verbatim historical text

Verbatim historical text

[Equal]: In November 2008, Zohreh O. Akbari proved that P is equal to NP. Her paper "A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes" appeared in Volume 35 of the "Proceedings of World Academy of Science, Engineering and Technology", and is available at http://www.waset.org/pwaset/v35/v35-74.pdf. Akbari designs a deterministic polynomial time algorithm for the NP-hard clique problem. In 2013, an updated version of the paper was presented at the 2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS), under the title "A polynomial-time algorithm for the maximum clique problem". The paper is available at IEEExplore. (Thanks to Andrew Fabbro and Austin Buchana for providing these links.)

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

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
Dead
http://www.waset.org/pwaset/v35/v35-74.pdf
DEAD:HTTPError · Link status checked 24 July 2026.
Look for an archived copy. A dead link does not change the claim’s status.
Link printed in the historical dossier
Dead
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6607889
DEAD:HTTPError · Link status checked 24 July 2026.
Look for an archived copy. A dead link does not change the claim’s status.

Cite this dossier

Plain text

The P versus NP Register. “Dossier 049: A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem.” As of 24 July 2026.

BibTeX

@misc{pvnp-register-049-2026,
  author = {{The P versus NP Register}},
  title = {A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem},
  year = {2026},
  note = {Dossier 049; as of 2026-07-24}
}

Event timeline

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