{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:40Z","timestamp":1725663580363},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:37Z","timestamp":1330207357000},"page":"271-277","source":"Crossref","is-referenced-by-count":0,"title":["A new method for proving lower bounds in the model of algebraic decision trees"],"prefix":"10.1007","author":[{"given":"Kristel","family":"Unger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D.P. Dobkin","year":"1979","unstructured":"Dobkin, D.P. and R. Lipton: On the complexity of computations under varying sets of primitives, J. Comp. Syst. Sci. 18(1979), pp. 86\u201391.","journal-title":"J. Comp. Syst. Sci."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Algorithms in Computational Geometry, Springer 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Preparata, F. P. and M. I. Shamos: Computational Geometry \u2014 an Introduction, Springer 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"J. M. Steele","year":"1982","unstructured":"Steele, J. M. and A. C. Yao: Lower bounds for algebraic decision trees, J. Algorithms 3 (1982), pp. 1\u20138.","journal-title":"J. Algorithms"},{"key":"24_CR5","unstructured":"Unger, K.: Obere und untere Schranken f\u00fcr Probleme der algorithmischen Geometrie in problemspezifischen Modellen (Ph.D. Thesis), Berlin 1990."}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:49:58Z","timestamp":1605646198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}