{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:45Z","timestamp":1725662925101},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:56:38Z","timestamp":1330185398000},"page":"110-117","source":"Crossref","is-referenced-by-count":7,"title":["On the complexity of computations under varying sets of primitives"],"prefix":"10.1007","author":[{"given":"David P.","family":"Dobkin","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"14_CR1","first-page":"448","volume":"7","author":"F. Blum","year":"1973","unstructured":"Blum, Floyd, Pratt, Rivest, Tarjan. Linear time bounds for selection. JCSS 7:448\u2013461, 1973.","journal-title":"JCSS"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Dobkin, Lipton. On some generalizations of binary search. ACM Symposium on the Theory of Computing, Seattle, Washington, May 1974.","DOI":"10.1145\/800119.803909"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Fischer, Meyer, Paterson. Lower bounds on the size of Boolean formulas. ACM Symposium on the Theory of Computing, Albuquerque, New Mexico, May 1975.","DOI":"10.1145\/800116.803751"},{"key":"14_CR4","unstructured":"Gr\u00fcnbaum. Convex Polytopes. Interscience Publishers, 1967."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0001-8708(72)90021-7","volume":"9","author":"S. Harper","year":"1972","unstructured":"Harper, Savage. On the complexity of the marriage problem. Advances in Mathematics 9:299\u2013312, 1972.","journal-title":"Advances in Mathematics"},{"key":"14_CR6","volume-title":"The effect of algebraic structure on the computational complexity of matrix multiplication","author":"Kerr","year":"1970","unstructured":"Kerr. The effect of algebraic structure on the computational complexity of matrix multiplication. PhD thesis, Cornell University, Ithaca, New York, 1970."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Lefschetz. Algebraic Geometry. Princeton University Press, 1953.","DOI":"10.1515\/9781400876686"},{"key":"14_CR8","unstructured":"Schnorr. A lower bound on the number of additions in monotone computations of monotone rational polynomials. Unpublished manuscript."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF02234362","volume":"1","author":"S. Sch\u00f6nhage","year":"1966","unstructured":"Sch\u00f6nhage, Strassen. Fast multiplication of large numbers (in German). Computing 1:182\u2013196, 1966.","journal-title":"Computing"},{"key":"14_CR10","unstructured":"Spira. On the number of comparisons necessary to rank an element. Computational Complexity Symposium, Courant Institute, 1973."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"Strassen","year":"1969","unstructured":"Strassen. Gaussian elimination is not optimal. Numerische Mathematik 13:354\u20136, 1969.","journal-title":"Numerische Mathematik"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 1972.","DOI":"10.1137\/0201010"},{"key":"14_CR13","unstructured":"Vilfan. The complexity of finite functions. Technical Report 97, Project MAC, MIT, 1972."}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:32Z","timestamp":1605643052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}