{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:44Z","timestamp":1763467484752},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00042-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"53-57","source":"Crossref","is-referenced-by-count":15,"title":["A very simple function that requires exponential size read-once branching programs"],"prefix":"10.1016","volume":"66","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00042-8_BIB1","series-title":"Proc. 18th Symp. on Theory of Computing","first-page":"30","article-title":"Two lower bounds for branching programs","author":"Ajtai","year":"1986"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200404","article-title":"On lower bounds for read-k-times branching programs","volume":"3","author":"Borodin","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB3","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1109\/43.277617","article-title":"Comparing two-level and ordered binary decision diagram representations of logic functions","volume":"5","author":"Devadas","year":"1993","journal-title":"IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0020-0190(97)00041-0","article-title":"A simple function that requires exponential size read-once branching programs","volume":"62","author":"G\u00e1l","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB5","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/12.324545","article-title":"Efficient Boolean manipulation with OBDDs can be extended to FBDDs","volume":"43","author":"Gergov","year":"1994","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","article-title":"Entropy of contact circuits and lower bound on their complexity","volume":"57","author":"Jukna","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB7","series-title":"Proc. Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"319","article-title":"On P versus NP \u2229 coNP for decision trees and read-once branching programs","volume":"Vol. 1295","author":"Jukna","year":"1997"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB8","first-page":"50","article-title":"On a problem of K. Zarankiewicz","volume":"3","author":"Kovari","year":"1954"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB9","first-page":"99","article-title":"Exponential lower bounds on the complexity of real time and local branching programs","volume":"24","author":"Krause","year":"1988","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90021-S","article-title":"Separating the eraser Turing machine classes Le, N Le, co-N Le and Pe","volume":"86","author":"Krause","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB11","series-title":"Proc. Fundamentals of Computation Theory","first-page":"263","article-title":"Lower bounds on the complexity of real-time branching programs","volume":"Vol. 278","author":"Kriegel","year":"1987"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00268321","article-title":"Some remarks on Boolean sums","volume":"12","author":"Mehlhorn","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB13","first-page":"236","article-title":"On a Boolean matrix","volume":"21","author":"Nechiporuk","year":"1971","journal-title":"Systems Theory Research"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB14","article-title":"On another Boolean matrix","author":"Pippenger","year":"1977","journal-title":"Tech. Rept. IBM"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB15","series-title":"Proc. 27th Symp. on Theory of Computing","first-page":"130","article-title":"A lower bound for integer multiplication with read-once branching programs","author":"Ponzio","year":"1995"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB16","series-title":"Proc. of Fundamentals of Computation Theory","first-page":"47","article-title":"Lower bounds for deterministic and nondeterministic branching programs","volume":"Vol. 529","author":"Razborov","year":"1991"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB17","article-title":"A large lower bound for 1-branching programs","author":"Savick\u00fd","year":"1996","journal-title":"ECCC Report TR 036-96"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(94)00078-W","article-title":"Graph driven BDDs\u2014a new data structure for Boolean functions","volume":"141","author":"Sieling","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB19","series-title":"Advances in Computational Complexity Theory","first-page":"183","article-title":"A new lower bound theorem for read-only-once branching programs and its applications","volume":"Vol. 13","author":"Simon","year":"1993"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00263988","article-title":"A new lower bound on the monotone network complexity of Boolean sums","volume":"13","author":"Wegener","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00042-8_BIB21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/42282.46161","article-title":"On the complexity of branching programs and decision trees for clique functions","volume":"35","author":"Wegener","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB22","series-title":"Proc. Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"562","article-title":"An exponential lower bound for one-time-only branching programs","volume":"Vol. 176","author":"Z\u0306\u00e1k","year":"1984"},{"key":"10.1016\/S0020-0190(98)00042-8_BIB23","first-page":"301","article-title":"Problem 101","volume":"2","author":"Zarankiewicz","year":"1951"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:43Z","timestamp":1556058463000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000428"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00042-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}