{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:14:50Z","timestamp":1742912090342,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_17","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"147-148","source":"Crossref","is-referenced-by-count":0,"title":["A Personal View of the P versus NP Problem"],"prefix":"10.1007","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400846610","volume-title":"The Golden Ticket: P, NP and the search for the impossible","author":"L. Fortnow","year":"2013","unstructured":"Fortnow, L.: The Golden Ticket: P, NP and the search for the impossible. Princeton University Press, Princeton (2013)"},{"key":"17_CR2","first-page":"151","volume-title":"Proceedings of the 3rd ACM Symposium on the Theory of Computing","author":"S. Cook","year":"1971","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on the Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"key":"17_CR3","first-page":"230","volume":"42","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the Etscheidungs problem. Proceedings of the London Mathematical Society\u00a042, 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"17_CR5","unstructured":"Levin, L.: Universal\u2019ny\u012de pereborny\u012de zadachi (Universal search problems: in Russian). Problemy Peredachi Informatsii\u00a09(3), 265\u2013266 (1973); Corrected English translation in [6]"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"R. Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, R.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Annals of the History of Computing\u00a06(4), 384\u2013400 (1984)","journal-title":"Annals of the History of Computing"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T19:09:16Z","timestamp":1676315356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}