{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:46Z","timestamp":1725663106565},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540078548"},{"type":"electronic","value":"9783540381693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1007\/3-540-07854-1_185","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:12:28Z","timestamp":1330186348000},"page":"265-269","source":"Crossref","is-referenced-by-count":2,"title":["A lower bound of 1\/2n2 on linear search programs for the knapsack problem"],"prefix":"10.1007","author":[{"given":"David","family":"Dobkin","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"29_CR1","unstructured":"D. Dobkin. A non-linear lower bound on linear search tree programs for solving knapsack problems. Yale Computer Science Research Report #52, 1975."},{"key":"29_CR2","unstructured":"D. Dobkin and R. Lipton. The complexity of searching lines in the plane. Submitted for publication."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"D. Dobkin and R. Lipton. On some generalizations of binary search. ACM Symposium on the Theory of Computing, Seattle, Washington, May 1974.","DOI":"10.1145\/800119.803909"},{"key":"29_CR4","unstructured":"D. Dobkin and R. Lipton. On the complexity of computations under varying sets of primitive operations. Automata Theory and Formal Languages, Springer-Verlag Lecture Notes in Computer Science #33."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"R. Karp. Reducibilities among combinatiral problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, 85\u2013104, Plenum Press, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"M. Rabin. Proving the simultaneous positivity of linear forms. JCSS, 6, 1972.","DOI":"10.1016\/S0022-0000(72)80034-5"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"E. Reingold. Computing the maximum and the median. Twelfth Annual Symposium on Switching and Automata Theory, 1971.","DOI":"10.1109\/SWAT.1971.9"},{"key":"29_CR8","unstructured":"C. Schnorr. A lower bound on the number of additions in monotone computations of monotone rational polynomials. Unpublished manuscript."},{"key":"29_CR9","unstructured":"E. L. Sheng. Threshold Logic. Academic Press, 1969."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"P. Spira. Complete linear proofs of systems of linear inequalities. JCSS, 6, pp. 205\u2013216, 1972.","DOI":"10.1016\/S0022-0000(72)80002-3"},{"key":"29_CR11","first-page":"926","volume":"14","author":"S. Yajima","year":"1965","unstructured":"S. Yajima and T. Ibaraki. A lower bound on the number of threshold functions. IEEE EC14:926\u2013929, 1965.","journal-title":"IEEE EC"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1976"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07854-1_185.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:34Z","timestamp":1605643114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07854-1_185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9783540078548","9783540381693"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-07854-1_185","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1976]]}}}