{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:05Z","timestamp":1742913725899,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319404172"},{"type":"electronic","value":"9783319404189"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40418-9_10","type":"book-chapter","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T12:57:30Z","timestamp":1469105850000},"page":"197-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Beautiful Theorem"],"prefix":"10.1007","author":[{"given":"Francisco Antonio","family":"Doria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A.","family":"Cosenza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,22]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T Baker","year":"1975","unstructured":"Baker, T., Gill, J., Solovay, R.: Relativizations of the $$P=?NP$$ question. SIAM J. Comput. 4, 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"key":"10_CR2","unstructured":"Ben\u2013David, S., Halevi, S.: On the independence of $$P\\ vs.\\ NP$$ . Technical Report #\u00a0699, Technion (1991)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"da Costa, N.C.A., Doria, F.A.: On the O\u2019Donnell algorithm for $$NP$$ \u2013complete problems. Rev. Behav. Econ. (2016)","DOI":"10.1561\/105.00000048"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Maymin, P.Z.: Markets are efficient if and only If $$P=NP$$ . Algorithmic Finance, 1(1), 1 (2011)","DOI":"10.3233\/AF-2011-007"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, M.: A programming language theorem which is independent of Peano arithmetic. In: Proceedings of 11th Annual ACM Symposium on the Theory of Computation, pp. 176\u2013188 (1979)","DOI":"10.1145\/800135.804411"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2307\/2370324","volume":"43","author":"EL Post","year":"1921","unstructured":"Post, E.L.: Introduction to a general theory of elementary propositions. Am. J. Math. 43, 163 (1921)","journal-title":"Am. J. Math."}],"container-title":["Intelligent Systems Reference Library","Towards Paraconsistent Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40418-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T06:08:33Z","timestamp":1600927713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40418-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319404172","9783319404189"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40418-9_10","relation":{},"ISSN":["1868-4394","1868-4408"],"issn-type":[{"type":"print","value":"1868-4394"},{"type":"electronic","value":"1868-4408"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}