{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:48Z","timestamp":1725456348861},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029959","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:59Z","timestamp":1133400299000},"page":"159-168","source":"Crossref","is-referenced-by-count":1,"title":["Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"16_CR1","unstructured":"Bollig, B., Sauerhoff, M., Sieling, D., and Wegener, I.: Hierarchy theorems for kOBDDs and kIBDDs. Accepted for publication in Theoretical Computer Science (1997). (Preliminary version: On the power of different types of restricted branching programs. Electronic Colloquium on Computational Complexity. TR 94-026)."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-60922-9_40","volume":"1046","author":"B. Bollig","year":"1996","unstructured":"Bollig, B. and Wegener, I.: Read-once projections and formal circuit verification with binary decision diagrams. STACS'96, Lecture Notes in Computer Science 1046 (1996), 491\u2013502.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 35 (1986), 677\u2013691.","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR4","unstructured":"Dietzfelbinger, M. and Savick\u00fd, P.: Parity OBDDs cannot represent the multiplication succinctly. Manuscript, Univ. Dortmund (1997)."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1109\/12.324545","volume":"43","author":"J. Gergov","year":"1994","unstructured":"Gergov, J. and Meinel, C.: Efficient Boolean manipulation with OBDDs can be extended to FBDDs. IEEE Trans. on Computers 43 (1994), 1197\u20131209.","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Hu, A.J., York, G., and Dill, D.L.: New techniques for efficient verification with implicitly conjoined BDDs. Proc. of 31st ACM\/IEEE Design Automation Conference (1994), 276\u2013282.","DOI":"10.1145\/196244.196377"},{"key":"16_CR7","unstructured":"Jain, J.: On Analysis of Boolean Functions. Ph.D. Thesis, Dept. of Electrical and Computer Engineering, University of Texas at Austin (1993)."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Jain, J., Abadir, M., Bitner, J., Fussell, D.S., and Abraham, J.A.: IBDDs: an efficient functional representation for digital circuits. Proc. European Design Automation Conference (1992), 440\u2013446.","DOI":"10.1109\/EDAC.1992.205973"},{"key":"16_CR9","unstructured":"Jain, J., Bitner, J., Fussell, D.S., and Abraham, J.A.: Functional partitioning for verification and related problems. Brown\/MIT VLSI Conf. (1992), 210\u2013226."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90072-A","volume":"91","author":"M. Krause","year":"1991","unstructured":"Krause, M.: Lower bounds for depth-restricted branching programs. Information and Computation 91 (1991), 1\u201314.","journal-title":"Information and Computation"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90021-S","volume":"86","author":"M. Krause","year":"1991","unstructured":"Krause, M., Meinel, C., and Waack, S.: Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science 86 (1991), 267\u2013275.","journal-title":"Theoretical Computer Science"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Narayan, A., Jain, J., Fujita, M., and Sangiovanni-Vincentelli, A.: Partitioned ROBDDs \u2014 a compact, canonical and efficiently manipulable representation for Boolean functions. Proc. of IEEE\/ACM Int. Conf. on Computer Aided Design ICCAD'96 (1996), 547\u2013554.","DOI":"10.1109\/ICCAD.1996.569909"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(94)00078-W","volume":"141","author":"D. Sieling","year":"1995","unstructured":"Sieling, D. and Wegener, I.: Graph driven BDDs \u2014 a new data structure for Boolean functions. Theoretical Computer Science 141 (1995), 283\u2013310.","journal-title":"Theoretical Computer Science"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BFb0023460","volume":"1200","author":"S. Waack","year":"1997","unstructured":"Waack, S.: On the descriptive and algorithmic power of parity ordered binary decision diagrams. Proc. of STACS'97, LNCS 1200 (1997), 201\u2013212.","journal-title":"Proc. of STACS'97, LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T08:54:44Z","timestamp":1547715284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029959","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}