Data · dataset · 2015
A Polynomial Time Solution to Solving Clique Problems, Proving P=NP
Listed in DataCite
I present a constructive prove that there exists a polynomial time algorithm to solve clique problems, thereby solving the open question posed by the Cook-Levin Theorem, that P = NP.
Links
Where it is published
- Repository landing page figshare.com/articles/dataset/A_Polynomial_Time_Solution_to_Solving_Clique_… ↗
landing page · from DataCite
- DOI doi.org/10.6084/m9.figshare.1332495 ↗
DOI / persistent id · from DataCite
Documentation and papers
Catalogue records · 2
- DataCite API api.datacite.org/dois/10.6084/m9.figshare.1332495 ↗
metadata API · from DataCite
- DataCite Commons commons.datacite.org/doi.org/10.6084/m9.figshare.1332495 ↗
catalogue entry · from DataCite
Topics
- Stated by source
- Computer and information sciences
Provenance · 1 source records, 9 field assertions
| Source | Key | Last seen | Raw |
|---|---|---|---|
| DataCite | 10.6084/m9.figshare.1332495 | 14 d ago | JSON v1 |
| Field | Assertion | Extractor | Evidence |
|---|---|---|---|
| access_level | source · DataCite | connector:datacite@1.0.0 | /data/attributes/rightsList |
| byte_size | source · DataCite | connector:datacite@1.0.0 | |
| concepts[field].fos:computer-and-information-sciences | source · DataCite | connector:datacite@1.0.0 | |
| created_date | source · DataCite | connector:datacite@1.0.0 | |
| description | source · DataCite | connector:datacite@1.0.0 | /data/attributes/descriptions |
| license | source · DataCite | connector:datacite@1.0.0 | /data/attributes/rightsList |
| publication_date | source · DataCite | connector:datacite@1.0.0 | /data/attributes/dates |
| title | source · DataCite | connector:datacite@1.0.0 | /data/attributes/titles/0/title |
| updated_date | source · DataCite | connector:datacite@1.0.0 |