{"data":{"id":"10.6084/m9.figshare.1332495","type":"dois","attributes":{"doi":"10.6084/m9.figshare.1332495","prefix":"10.6084","suffix":"m9.figshare.1332495","identifiers":[],"alternateIdentifiers":[],"creators":[{"name":"Laplante, Michael","nameType":"Personal","givenName":"Michael","familyName":"Laplante","affiliation":[],"nameIdentifiers":[{"schemeUri":"https://orcid.org","nameIdentifier":"https://orcid.org/0000-0003-0363-7800","nameIdentifierScheme":"ORCID"}]}],"titles":[{"title":"A Polynomial Time Solution to Solving Clique Problems, Proving P=NP"}],"publisher":"figshare","container":{},"publicationYear":2015,"subjects":[{"subject":"80309 Software Engineering","subjectScheme":"FOR"},{"subject":"FOS: Computer and information sciences","schemeUri":"http://www.oecd.org/science/inno/38235147.pdf","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"Computer Software"},{"subject":"Computation Theory and Mathematics"},{"subject":"Theoretical Computer Science"},{"subject":"Algebra"}],"contributors":[],"dates":[{"date":"2015-03-11","dateType":"Created"},{"date":"2015-03-11","dateType":"Updated"},{"date":"2015","dateType":"Issued"}],"language":null,"types":{"ris":"DATA","bibtex":"misc","citeproc":"dataset","schemaOrg":"Dataset","resourceType":"Dataset","resourceTypeGeneral":"Dataset"},"relatedIdentifiers":[],"relatedItems":[],"sizes":["1223764 Bytes"],"formats":[],"version":null,"rightsList":[{"rights":"Creative Commons Attribution 4.0 International","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rightsIdentifier":"cc-by-4.0","rightsIdentifierScheme":"SPDX"}],"descriptions":[{"description":"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.","descriptionType":"Abstract"}],"geoLocations":[],"fundingReferences":[],"xml":"PD94bWwgdmVyc2lvbj0iMS4wIiBlbmNvZGluZz0iVVRGLTgiPz4KPHJlc291cmNlIHhtbG5zPSJodHRwOi8vZGF0YWNpdGUub3JnL3NjaGVtYS9rZXJuZWwtNCIgeG1sbnM6eHNpPSJodHRwOi8vd3d3LnczLm9yZy8yMDAxL1hNTFNjaGVtYS1pbnN0YW5jZSIgeHNpOnNjaGVtYUxvY2F0aW9uPSJodHRwOi8vZGF0YWNpdGUub3JnL3NjaGVtYS9rZXJuZWwtNCBodHRwOi8vc2NoZW1hLmRhdGFjaXRlLm9yZy9tZXRhL2tlcm5lbC00LjEvbWV0YWRhdGEueHNkIj4KICA8aWRlbnRpZmllciBpZGVudGlmaWVyVHlwZT0iRE9JIj4xMC42MDg0L005LkZJR1NIQVJFLjEzMzI0OTU8L2lkZW50aWZpZXI+CiAgPGNyZWF0b3JzPgogICAgPGNyZWF0b3I+CiAgICAgIDxjcmVhdG9yTmFtZT5NaWNoYWVsIExhcGxhbnRlPC9jcmVhdG9yTmFtZT4KICAgICAgPG5hbWVJZGVudGlmaWVyIG5hbWVJZGVudGlmaWVyU2NoZW1lPSJPUkNJRCIgc2NoZW1lVVJJPSJodHRwOi8vb3JjaWQub3JnIj4wMDAwLTAwMDMtMDM2My03ODAwPC9uYW1lSWRlbnRpZmllcj4KICAgIDwvY3JlYXRvcj4KICA8L2NyZWF0b3JzPgogIDx0aXRsZXM+CiAgICA8dGl0bGU+QSBQb2x5bm9taWFsIFRpbWUgU29sdXRpb24gdG8gU29sdmluZyBDbGlxdWUgUHJvYmxlbXMsIFByb3ZpbmcgUD1OUDwvdGl0bGU+CiAgPC90aXRsZXM+CiAgPGRlc2NyaXB0aW9ucz4KICAgIDxkZXNjcmlwdGlvbiBkZXNjcmlwdGlvblR5cGU9IkFic3RyYWN0Ij4mbHQ7cCZndDtJIHByZXNlbnQgYSBjb25zdHJ1Y3RpdmUgcHJvdmUgdGhhdCB0aGVyZSBleGlzdHMgYSBwb2x5bm9taWFsIHRpbWUgYWxnb3JpdGhtIHRvIHNvbHZlIGNsaXF1ZSBwcm9ibGVtcywgdGhlcmVieSBzb2x2aW5nIHRoZSBvcGVuIHF1ZXN0aW9uIHBvc2VkIGJ5IHRoZSBDb29rLUxldmluIFRoZW9yZW0sIHRoYXQgUCA9IE5QLiZsdDsvcCZndDs8L2Rlc2NyaXB0aW9uPgogIDwvZGVzY3JpcHRpb25zPgogIDxzdWJqZWN0cz4KICAgIDxzdWJqZWN0IHNjaGVtZVVSST0iaHR0cDovL3d3dy5hYnMuZ292LmF1L2F1c3N0YXRzL2Fic0AubnNmLzAvNkJCNDI3QUI5Njk2QzIyNUNBMjU3NDE4MDAwNDQ2M0UiIHN1YmplY3RTY2hlbWU9IkZPUiI+ODAzMDkgU29mdHdhcmUgRW5naW5lZXJpbmc8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5Db21wdXRlciBTb2Z0d2FyZTwvc3ViamVjdD4KICAgIDxzdWJqZWN0PkNvbXB1dGF0aW9uIFRoZW9yeSBhbmQgTWF0aGVtYXRpY3M8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5UaGVvcmV0aWNhbCBDb21wdXRlciBTY2llbmNlPC9zdWJqZWN0PgogICAgPHN1YmplY3Q+QWxnZWJyYTwvc3ViamVjdD4KICA8L3N1YmplY3RzPgogIDxwdWJsaXNoZXI+Zmlnc2hhcmU8L3B1Ymxpc2hlcj4KICA8cHVibGljYXRpb25ZZWFyPjIwMTU8L3B1YmxpY2F0aW9uWWVhcj4KICA8ZGF0ZXM+CiAgICA8ZGF0ZSBkYXRlVHlwZT0iQ3JlYXRlZCI+MjAxNS0wMy0xMTwvZGF0ZT4KICAgIDxkYXRlIGRhdGVUeXBlPSJVcGRhdGVkIj4yMDE1LTAzLTExPC9kYXRlPgogIDwvZGF0ZXM+CiAgPHJlc291cmNlVHlwZSByZXNvdXJjZVR5cGVHZW5lcmFsPSJEYXRhc2V0Ij5EYXRhc2V0PC9yZXNvdXJjZVR5cGU+CiAgPHNpemVzPgogICAgPHNpemU+MTIyMzc2NCBCeXRlczwvc2l6ZT4KICA8L3NpemVzPgogIDxyaWdodHNMaXN0PgogICAgPHJpZ2h0cyByaWdodHNVUkk9Imh0dHBzOi8vY3JlYXRpdmVjb21tb25zLm9yZy9saWNlbnNlcy9ieS80LjAvIj5DQyBCWSA0LjA8L3JpZ2h0cz4KICA8L3JpZ2h0c0xpc3Q+CjwvcmVzb3VyY2U+","url":"https://figshare.com/articles/dataset/A_Polynomial_Time_Solution_to_Solving_Clique_Problems_Proving_P_NP/1332495","contentUrl":null,"metadataVersion":2,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"viewsOverTime":[],"downloadCount":0,"downloadsOverTime":[],"referenceCount":0,"citationCount":0,"citationsOverTime":[],"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2015-03-11T19:21:21.000Z","registered":"2015-03-11T19:21:23.000Z","published":"2015","updated":"2020-09-04T18:35:27.000Z"},"relationships":{"client":{"data":{"id":"figshare.ars","type":"clients"}},"provider":{"data":{"id":"otjm","type":"providers"}},"media":{"data":{"id":"10.6084/m9.figshare.1332495","type":"media"}},"references":{"data":[]},"citations":{"data":[]},"parts":{"data":[]},"partOf":{"data":[]},"versions":{"data":[]},"versionOf":{"data":[]}}}}