{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:53Z","timestamp":1725486473915},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_24","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"356-364","source":"Crossref","is-referenced-by-count":0,"title":["Some Notes on the Information Flow in Read-Once Branching Programs"],"prefix":"10.1007","author":[{"given":"Stasys","family":"Jukna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"\u017d\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(98)00042-8","volume":"66","author":"B. Bollig","year":"1998","unstructured":"B. Bollig and I. Wegener, A very simple function that requires exponential size read-once branching programs, Inf. Process. Letters 66 (1998), 53\u201358. 360","journal-title":"Inf. Process. Letters"},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BFb0055059","volume-title":"On branching programs with bounded uncertainty","author":"S. Jukna","year":"1998","unstructured":"S. Jukna and S. \u017d\u00e1k, On branching programs with bounded uncertainty. In: Proc. of ICALP\u201998, Springer LNCS 1443 (1998), 259\u2013270. 357, 358, 359"},{"issue":"4","key":"24_CR3","first-page":"999","volume":"7","author":"E. I. Nechiporuk","year":"1966","unstructured":"E. I. Nechiporuk, On a Boolean function, Soviet Mathematics Doklady 7:4 (1966), 999\u20131000. (In Russian).","journal-title":"Soviet Mathematics Doklady"},{"key":"24_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-54458-5_49","volume-title":"Lower bounds for deterministic and nondeterministic branching programs","author":"A. Razborov","year":"1991","unstructured":"Razborov, A. (1991): Lower bounds for deterministic and nondeterministic branching programs, in: Proc. FCT\u201991, Springer Lecture Notes in Computer Science 529, 47\u201360. 356"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Wegener, I. (2000): Branching programs and Binary Decision Diagrams: Theory and Applications. SIAM Series in Discrete Mathematics and Applications. 356","DOI":"10.1137\/1.9780898719789"},{"key":"24_CR6","unstructured":"S. \u017d\u00e1k, Upper bounds for gentle branching programs, Tech. Rep. Nr. 788, Inst. of Comput. Sci., Czech Acad. of Sci., 1999. 357"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T04:23:10Z","timestamp":1556511790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}