{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:11:57Z","timestamp":1648861917651},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00486-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"143-148","source":"Crossref","is-referenced-by-count":1,"title":["A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs"],"prefix":"10.1016","volume":"86","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00486-6_BIB001","series-title":"Proc. of 40th FOCS","first-page":"60","article-title":"A non-linear time lower bound for Boolean branching programs","author":"Ajtai","year":"1999"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB002","series-title":"Proc. of 41st FOCS","first-page":"169","article-title":"Super-linear time-space tradeoff lower bounds for randomized computation","author":"Beame","year":"2000"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB003","series-title":"Proc. of 34th STOC","first-page":"688","article-title":"Time-space trade-offs, multiparty communication complexity, and nearest neighbor problems","author":"Beame","year":"2002"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB004","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1051\/ita:2001113","article-title":"Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication","volume":"35","author":"Bollig","year":"2001","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/S0020-0190(02)00486-6_BIB005","doi-asserted-by":"crossref","unstructured":"B. Bollig, Complexity theoretical results on nondeterministic graph-driven read-once branching programs, Forschungsbericht Universit\u00e4t Dortmund Nr. 772, 2002","DOI":"10.1007\/3-540-36494-3_27"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB006","series-title":"Proc. of 2nd IFIP International Conference on Theoretical Computer Science","first-page":"83","article-title":"Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication","author":"Bollig","year":"2002"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB007","series-title":"Proc. of MFCS","first-page":"131","article-title":"A lower bound technique for nondeterministic graph-driven read-once branching programs and its applications","author":"Bollig","year":"2002"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB008","series-title":"Proc. of MFCS","first-page":"212","article-title":"Graph-driven free parity BDDs: algorithms and lower bounds","author":"Brosenne","year":"2001"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB009","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00486-6_BIB010","series-title":"Proc. of STACS","first-page":"576","article-title":"Frontiers of feasible and probabilistic feasible boolean manipulation with branching programs","volume":"665","author":"Gergov","year":"1993"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB011","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(02)00486-6_BIB012","series-title":"Communication Complexity and Parallel Computing","author":"Hromkovi\u010d","year":"1997"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB013","series-title":"Proc. of FST","first-page":"246","article-title":"The effect of null-chains on the complexity of contact schemes","volume":"380","author":"Jukna","year":"1989"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB014","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s000370050005","article-title":"On P versus NP\u2229CO-NP for decision trees and read-once branching programs","volume":"8","author":"Jukna","year":"1999","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB015","series-title":"Proc. of EUROCRYPT","first-page":"222","article-title":"BDD-based cryptanalysis of keystream generators","author":"Krause","year":"2002"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB016","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90021-S","article-title":"Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe","volume":"86","author":"Krause","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00486-6_BIB017","series-title":"Communication Complexity","author":"Kushilevitz","year":"1997"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB018","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(02)00486-6_BIB019","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1011229414976","article-title":"A comparison of free BDDs and transformed BDDs","volume":"19","author":"Sielingand","year":"2001","journal-title":"Formal Methods System Design"},{"key":"10.1016\/S0020-0190(02)00486-6_BIB020","series-title":"Branching Programs and Binary Decision Diagrams\u2014Theory and Applications","author":"Wegener","year":"2000"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004866?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004866?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:24:27Z","timestamp":1584509067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002004866"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00486-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}