{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:49:10Z","timestamp":1725626950790},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540103882"},{"type":"electronic","value":"9783642678387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/978-3-642-67838-7_34","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:19:29Z","timestamp":1320229169000},"page":"365-374","source":"Crossref","is-referenced-by-count":0,"title":["Untere Zeitschranken f\u00fcr das Rucksack-Problem"],"prefix":"10.1007","author":[{"given":"P.","family":"Klein","sequence":"first","affiliation":[]},{"given":"F.","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Euclidean geometry and convexity","author":"RV Benson","year":"1916","unstructured":"R.V. Benson, Euclidean geometry and convexity. Mc Graw-Hill 1916"},{"key":"34_CR2","first-page":"369","volume":"23","author":"W Blaschke","year":"1914","unstructured":"W. Blaschke, \u00dcber dem gr\u00f6\u00dften Kreis in einer konvexen Punktmenge. Jahresbericht der Deutschen Mathematiker-Vereinigung 23, 1914, pp 369\u2013374","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","volume":"16","author":"D Dobkin","year":"1978","unstructured":"D. Dobkin; R. Lipton, A lower bound of 1\/2 n2 on linear search programs for the Knapsack Problem. Journal of Computer and Systems Science 16, 1978, pp. 413\u2013417","journal-title":"Journal of Computer and Systems Science"},{"key":"34_CR4","unstructured":"P. Klein; F. Meyer auf der Heide, Lower time bounds for the Knapsack-Problem on several Random Access Machines, Preprint"},{"key":"34_CR5","volume-title":"Komplexit\u00e4tstheorie","author":"W Paul","year":"1979","unstructured":"W. Paul, Komplexit\u00e4tstheorie, B.G. Teubner, 1979"},{"key":"34_CR6","volume-title":"Decision trees and Random Access Machines","author":"WJ Paul","year":"1980","unstructured":"W.J. Paul; J. Simon, Decision trees and Random Access Machines. Symposium \u00fcber Logik und Algorithmik, Z\u00fcrich 1980"},{"key":"34_CR7","volume-title":"Threshold Logic","author":"CL Sheny","year":"1969","unstructured":"C.L. Sheny, Threshold Logic. Academic Press, London, New York 1969"},{"key":"34_CR8","first-page":"926","volume":"14","author":"S Yajima","year":"1965","unstructured":"S. Yajima; T. Ibanaki, A lower bound on the number of threshhold functions, IEEE \u2014 EC 14, 1965, pp. 926\u2013929","journal-title":"IEEE \u2014 EC"}],"container-title":["Informatik-Fachberichte","GI - 10. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-67838-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:09:53Z","timestamp":1606255793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-67838-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540103882","9783642678387"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-67838-7_34","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1980]]}}}