{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:26:20Z","timestamp":1725636380081},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540531326"},{"type":"electronic","value":"9783642760716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/978-3-642-76071-6_31","type":"book-chapter","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T18:16:55Z","timestamp":1321985815000},"page":"277-281","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Complexity of Occam\u2019s Razor"],"prefix":"10.1007","author":[{"given":"Achim G.","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth: Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension; Proceedings, 18th\n                  Symp. on Theory of Computing\n                  1986.","DOI":"10.1145\/12130.12158"},{"key":"31_CR2","first-page":"377","volume-title":"Information Processing Letters","author":"A Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth: Occam\u2019s Razor; Information Processing Letters 24 (1987) pp. 377\u2013380; North-Holland"},{"key":"31_CR3","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"M.R. Garey und D.S. Johnson: Computers and Intractability: A guide to the theory of NP-completeness; 1979, San Francisco, CA: W. H. Freeman"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"D.S. Johnson: Approximation Algorithms for Combinatorial Problems; Journal for Computer and Systems Sciences, 9, pp. 256\u2013278, 1974","journal-title":"Journal for Computer and Systems Sciences"},{"key":"31_CR5","volume-title":"Fact, Fiction and Forecast","author":"N Goodman","year":"1954","unstructured":"Nelson Goodman: Fact, Fiction and Forecast, London, 1954"},{"key":"31_CR6","volume-title":"Occam\u2019s Razor","author":"D Duncan","year":"1957","unstructured":"D. Duncan: Occam\u2019s Razor, London, New York 1957"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1017\/S0031819100019392","volume":"51","author":"JJC Smart","year":"1976","unstructured":"J.J.C. Smart: Materialism and Occam\u2019s Razor, Philosophy, 51, pp. 349\u2013352, 1976.","journal-title":"Philosophy"}],"container-title":["Informatik-Fachberichte","GWAI-90 14th German Workshop on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-76071-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T03:03:10Z","timestamp":1606273390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-76071-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540531326","9783642760716"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-76071-6_31","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1990]]}}}