{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:41:43Z","timestamp":1742956903232,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_34","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"411-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Free Binary Decision Diagrams for Computation of EARn"],"prefix":"10.1007","author":[{"given":"Jan","family":"K\u00e1ra","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0022-0000(87)90010-9","volume":"35","author":"L. Babai","year":"1987","unstructured":"Babai, L., Hajnal, P., Szemer\u00e9di, E., Tur\u00e1n, G.: A lower bound for read-once only branching programs. Journal of Computer and System Sciences 35 (1987) 153\u2013162","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1051\/ita\/1988220404471","volume":"22","author":"K. Kriegel","year":"1988","unstructured":"Kriegel, K., Waack, S.: Lower bounds on the complexity of real-time branching programs. RAIRO \u2014 Theoretical Informatics and Applications 22 (1988) 447\u2013459.","journal-title":"RAIRO \u2014 Theoretical Informatics and Applications"},{"key":"34_CR3","unstructured":"Masek, W.: A fast algorithm for the string editing problem and decision graph complexity. M. Sc. Thesis, MIT (1976)"},{"key":"34_CR4","unstructured":"Savick\u00fd, P., \u017d\u00e1k, S.: A large lower bound for 1-branching programs. ECCC report 96-036 (1996)"},{"issue":"1\u20132","key":"34_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00219-9","volume":"238","author":"P. Savick\u00fd","year":"2000","unstructured":"Savick\u00fd, P., \u017d\u00e1k, S.: A read-once lower bound and (1,+k)-hierarchy for branching programs. Theoretical Computer Science 238(1\u20132) (2000) 347\u2013362","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams \u2014 Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications 4 (2000)","DOI":"10.1137\/1.9780898719789"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/42282.46161","volume":"35","author":"I. Wegener","year":"1988","unstructured":"Wegener, I.: On the complexity of branching programs and decision trees for clique functions, Journal of the ACM 35 (1988) 461\u2013471","journal-title":"Journal of the ACM"},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/BFb0030340","volume-title":"Proc. 11th International Symposium on Mathematical Foundations of Computer Science 1984","author":"S. \u017d\u00e1k","year":"1984","unstructured":"\u017d\u00e1k, S.: An exponential lower bound for one-time-only branching programs. Proc. 11th International Symposium on Mathematical Foundations of Computer Science 1984, LNCS vol. 176 (1984) 562\u2013566"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:13:21Z","timestamp":1674072801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}