{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:01Z","timestamp":1725490201272},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"212-223","source":"Crossref","is-referenced-by-count":5,"title":["Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Brosenne","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Homeister","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Waack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44612-5_18","volume-title":"Proceedings, 25th Mathematical Foundations of Computer Science","author":"B. Bollig","year":"2000","unstructured":"Bollig, B. (2000), Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication, in \u201cProceedings, 25th Mathematical Foundations of Computer Science\u201d, Lecture Notes in Computer Science 1893, Springer-Verlag, pp. 222\u2013231."},{"key":"19_CR2","unstructured":"Breitbart, Y., Hunt, H. B., AND Rosenkrantz, D. (1991) The size of binary decision diagrams representing Boolean functions, Preprint."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E. Bryant","year":"1986","unstructured":"Bryant, R. E. (1986), Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers35, pp. 677\u2013691.","journal-title":"IEEE Trans. on Computers"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R. E. Bryant","year":"1991","unstructured":"Bryant, R. E. (1991), On the complexity of VLSI implementations of Boolean functions with applications to integer multiplication, IEEE Trans. on Computers40, pp. 205\u2013213.","journal-title":"IEEE Trans. on Computers"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., AND Winograd, S. (1990), Matrix multiplication via arithmetic progressions, J. Symbolic Computation9, pp. 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/3-540-56503-5_57","volume-title":"Proceedings, 10th Symposium on Theoretical Aspects of Computer Science","author":"J. Gergov","year":"1993","unstructured":"Gergov, J., AND Meinel, Ch. (1993), Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs, in \u201cProceedings, 10th Symposium on Theoretical Aspects of Computer Science\u201d, Lecture Notes in Computer Science 665, Springer-Verlag, pp. 576\u2013585."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00709139","volume":"8","author":"J. Gergov","year":"1996","unstructured":"Gergov, J., AND Meinel, Ch. (1996), Mod-2-OBDDs \u2014 a data structure that generalizes exor-sum-of-products and ordered binary decision diagrams, Formal Methods in System Design8, pp. 273\u2013282.","journal-title":"Formal Methods in System Design"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","volume":"57","author":"S. Jukna","year":"1988","unstructured":"Jukna, S. (1988), Entropy of contact circuits and lower bounds on their complexity, Theoretical Computer Science57, pp. 113\u2013129.","journal-title":"Theoretical Computer Science"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0020-0190(99)00027-7","volume":"69","author":"S. Jukna","year":"1999","unstructured":"Jukna, S. (1999), Linear codes are hard for oblivious read-once parity branching programs, Information Processing Letters69, pp. 267\u2013269.","journal-title":"Information Processing Letters"},{"key":"19_CR10","unstructured":"MacWilliams, E. J., AND Sloane, N. J. A. (1977), The theory of errorcorrecting codes, Elsevier, North-Holl."},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/3-540-44612-5_60","volume-title":"Proceedings, 25th Mathematical Foundations of Computer Science","author":"P. Savick\u00fd","year":"2000","unstructured":"Savick\u00fd, P., AND Sieling, D. (2000), A hierarchy result for read-once branching programs with restricted parity nondeterminism, in \u201dProceedings, 25th Mathematical Foundations of Computer Science\u201d, Lecture Notes in Computer Science 1893, Springer-Verlag, pp. 650\u2013659."},{"key":"19_CR12","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. (1995), Graph Driven BDD\u2019s \u2014 a new Data Structure for Boolean Functions, Theoretical Computer Science141, pp. 283\u2013310.","journal-title":"Theoretical Computer Science"},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-46691-6_29","volume-title":"Proceedings of Conference on the Foundations of Software Technology and Theoretical Computer Science","author":"D. Sieling","year":"1999","unstructured":"Sieling, D. (1999b), Lower bounds for linear transformed OBDDs and FBDDs, in \u201dProceedings of Conference on the Foundations of Software Technology and Theoretical Computer Science\u201d, Lecture Notes in Computer Science 1738, Springer-Verlag, pp. 356\u2013368."},{"key":"19_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BFb0023460","volume-title":"Proceedings, 14th Symposium on Theoretical Aspects of Computer Science","author":"St. Waack","year":"1997","unstructured":"Waack, St. (1997), On the descriptive and algorithmic power of parity ordered binary decision diagrams, in \u201dProceedings, 14th Symposium on Theoretical Aspects of Computer Science\u201d, Lecture Notes in Computer Science 1200, Springer-Verlag, pp. 201\u2013212."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Wegener, I. (2000), \u201dBranching programs and binary decision diagrams\u201d, SIAM Monographs on Discrete Mathematics and Applications.","DOI":"10.1137\/1.9780898719789"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T00:52:01Z","timestamp":1550883121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}