{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:55Z","timestamp":1725663415569},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:35:45Z","timestamp":1330176945000},"page":"111-117","source":"Crossref","is-referenced-by-count":0,"title":["Some results on decision trees with relations to computational trees"],"prefix":"10.1007","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or,M., Lower bounds for algebraic computation trees, Proc. of the 15-th STOC, Boston, 1983, 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Jaromczyk,J.W.,Lower bounds for polygon simplicity testing and other problems, Lecture Notes in Computer Science v.176, 1984","DOI":"10.1007\/BFb0030315"},{"key":"11_CR3","unstructured":"Jaromczyk,J.W., Computational complexity in the model of decision trees, Warsaw, April 1984 (in polish)."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J. Milnor","year":"1964","unstructured":"Milnor, J., On the Betti numbers of real algebraic varieties, Proc. AMS 15, 1964, 275\u2013280.","journal-title":"Proc. AMS"},{"key":"11_CR5","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., Yao, A.C., Lower bounds for algebraic decision trees, J.Algorithms 3, 1982, 1\u20138.","journal-title":"J.Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:02:47Z","timestamp":1619542967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}