{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:08:59Z","timestamp":1648994939672},"reference-count":16,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1051\/ita:2002011","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T16:55:04Z","timestamp":1068828904000},"page":"229-247","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs"],"prefix":"10.1051","volume":"36","author":[{"given":"Henrik","family":"Brosenne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Homeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Waack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,12,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"B. Bollig, St. Waack and P. Woelfel, Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication, inProc. 2nd IFIP International Conference on Theoretical Computer Science(2002).","DOI":"10.1007\/978-0-387-35608-2_8"},{"key":"R2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(94)00181-H","volume":"145","author":"Breitbart","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-44683-4_19","volume":"2136","author":"Brosenne","year":"2001","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"Bryant","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"R.E. Bryant, Symbolic manipulation of Boolean functions using a graphical representation, inProc. 22nd DAC. Piscataway, NJ (1985) 688-694.","DOI":"10.1109\/DAC.1985.1586017"},{"key":"R6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"R7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symb. Comput."},{"key":"R8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/3-540-56503-5_57","volume":"665","author":"Gergov","year":"1993","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00709139","volume":"8","author":"Gergov","year":"1996","journal-title":"Formal Methods in System Design"},{"key":"R10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","volume":"57","author":"Jukna","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"R11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0190(99)00027-7","volume":"69","author":"Jukna","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"R12","unstructured":"E.J. MacWilliams and N.J.A. Sloane,The Theory of Error-Correcting Codes. Elsevier (1977)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-46691-6_29","volume":"1738","author":"Sieling","year":"1999","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0304-3975(94)00078-W","volume":"141","author":"Sieling","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"R15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/inco.2000.3022","volume":"166","author":"St. Waack","year":"2001","journal-title":"Inform. Comput."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"I. Wegener,Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM, Philadelphia,SIAM Monogr. Discrete Math. Appl.(2000).","DOI":"10.1137\/1.9780898719789"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:01:55Z","timestamp":1585263715000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":16,"journal-issue":{"issue":"3"},"alternative-id":["ita0133"],"URL":"https:\/\/doi.org\/10.1051\/ita:2002011","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}