{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:59:12Z","timestamp":1743033552300,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396519"},{"type":"electronic","value":"9783642396526"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39652-6_3","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T06:18:10Z","timestamp":1383891490000},"page":"59-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The One Million Dollars Problem"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Panconesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-1-4612-2566-9_4","volume-title":"Feasible Mathematics II","author":"S.R. Buss","year":"1995","unstructured":"Buss, S.R.: On G\u00f6del\u2019s theorems on lengths of proofs. II: lower bounds for recognizing k-symbol provability. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, pp. 57\u201390. Birkhauser, Boston (1995)"},{"key":"3_CR19","volume-title":"Il club dei matematici solitari del prof","author":"A. Connes","year":"2009","unstructured":"Connes, A.: Visionari, poeti e precursori. In: Odifreddi, P. (ed.) Il club dei matematici solitari del prof. Odifreddi. Mondadori, Milano (2009)"},{"key":"3_CR24","volume-title":"Engines of Logic: Mathematicians and the Origin of the Computer","author":"M. Davis","year":"2001","unstructured":"Davis, M.: Engines of Logic: Mathematicians and the Origin of the Computer. W. W. Norton & Company, New York (2001)"},{"key":"3_CR47","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"3_CR60","volume-title":"Alan Turing: The Enigma","author":"A. Hodges","year":"1983","unstructured":"Hodges, A.: Alan Turing: The Enigma. Simon & Schuster, New York (1983)"},{"key":"3_CR67","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Addison-Wesley, Boston (2005)"},{"key":"3_CR79","unstructured":"Millennium problems. Clay Mathematics Institute. http:\/\/www.claymath.org (2000)"},{"key":"3_CR83","volume-title":"G\u00f6del\u2019s Proof","author":"E. Nagel","year":"2008","unstructured":"Nagel, E., Newman, J.: G\u00f6del\u2019s Proof. NYU Press, New York (2008)"},{"key":"3_CR85","doi-asserted-by":"crossref","unstructured":"Newson, M.W. (trans.): Mathematical problems. Bull. Am. Math. Soc. 8, 437\u2013479 (1902). (A reprint appears in Mathematical Developments Arising from Hilbert Problems, edited by Felix Brouder, American Mathematical Society, 1976)","DOI":"10.1090\/S0002-9904-1902-00923-3"},{"key":"3_CR89","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1993)"},{"issue":"4","key":"3_CR106","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"B.A. Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to perebor (brute-force searches) algorithms. IEEE Ann. Hist. Comput. 6(4), 384\u2013400 (1984)","journal-title":"IEEE Ann. Hist. Comput."}],"container-title":["The Power of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39652-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:25:59Z","timestamp":1676827559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39652-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396519","9783642396526"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39652-6_3","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 September 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}