{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:27Z","timestamp":1725662847252},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108436"},{"type":"electronic","value":"9783540387459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10843-2_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:27:59Z","timestamp":1330190879000},"page":"305-315","source":"Crossref","is-referenced-by-count":4,"title":["Proving lower bounds for linear decision trees"],"prefix":"10.1007","author":[{"given":"Marc","family":"Snir","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","volume":"21","author":"M. Friedman","year":"1978","unstructured":"M. Friedman and B. Weide, On the complexity of computing the measure of \u222a[ai,bi], Comm. ACM 21 (1978), 540\u2013544.","journal-title":"Comm. ACM"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"F. Fussenegger and H. Gabow, Using comparison trees to derive lower bounds for selection problems, Proceedings IEEE Ann. Symp. on Foundations of Computer Science (1976), 178\u2013182.","DOI":"10.1109\/SFCS.1976.34"},{"key":"25_CR3","volume-title":"Convex Polytopes","author":"B. Grunbaum","year":"1967","unstructured":"B. Grunbaum, Convex Polytopes, Wiley, London, 1967."},{"key":"25_CR4","series-title":"Annals of Math. Studies","first-page":"189","volume-title":"Contributions to the Theory of Games, Vol. 3","author":"J. C. Holladay","year":"1957","unstructured":"J. C. Holladay, Cartesian products of termination games, in: M. Dresher, A. W. Tucker, P. Wolfe (Eds.), Contributions to the Theory of Games, Vol. 3, Annals of Math. Studies No. 39, Princeton University Press, Princeton, N. J., 1957, 189\u2013199."},{"key":"25_CR5","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973."},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. T. Kung","year":"1975","unstructured":"H. T. Kung, F. L. Luccio and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM 22 (1975), 469\u2013476.","journal-title":"J. ACM"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0304-3975(76)90089-X","volume":"2","author":"W. J. Paul","year":"1976","unstructured":"W. J. Paul, Realizing Boolean functions on disjoint sets of variables, Th. Comp. Sci. 2 (1976), 383\u2013396.","journal-title":"Th. Comp. Sci."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"M. O. Rabin","year":"1972","unstructured":"M. O. Rabin, Proving simultaneous positivity of linear forms, J. Comput. Sys. Sci. 6 (1972), 639\u2013650.","journal-title":"J. Comput. Sys. Sci."},{"key":"25_CR9","unstructured":"M. O. Rabin, Private communication."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"E. M. Reingold, Computing the maxima and the median, Proc. IEEE 12th Ann. Symp. on Switching and Automata Theory (1971), 216\u2013218.","DOI":"10.1109\/SWAT.1971.9"},{"key":"25_CR11","unstructured":"M. Snir, Comparisons between linear forms can help, Tech. Rep. CSR-60-80, Comp. Sci. Dept., Univ. of Edinburgh, 1980. Also to be published in Th. Comp. Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"A. C. Yao, On the complexity of comparison problems using linear functions, Proc. IEEE 16th. Ann. Symp. on Foundations of Computer Science (1975), 85\u201389.","DOI":"10.1109\/SFCS.1975.20"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1137\/0209028","volume":"9","author":"A. C. Yao","year":"1980","unstructured":"A. C. Yao and R. Rivest, On the polyhedral decision problem, SIAM J. Comput. 9 (1980), 343\u2013347.","journal-title":"SIAM J. Comput."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"C. K. Yap, On lifted problems, Proc. IEEE 19th Ann. Symp. on Foundations of Computer Science (1978), 267\u2013279.","DOI":"10.1109\/SFCS.1978.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10843-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:37Z","timestamp":1605643417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10843-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108436","9783540387459"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-10843-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}