{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:40:03Z","timestamp":1739468403934,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_19","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"224-234","source":"Crossref","is-referenced-by-count":3,"title":["Symbolic OBDD-Based Reachability Analysis Needs Exponential Space"],"prefix":"10.1007","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","first-page":"277","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J.L., Lozano, A.: The Complexity of Graph Problems for Succinctly Represented Graphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 277\u2013285. Springer, Heidelberg (1990)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-79228-4_27","volume-title":"Theory and Applications of Models of Computation","author":"B. Bollig","year":"2008","unstructured":"Bollig, B.: On the OBDD Complexity of the Most Significant Bit of Integer Multiplication. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 306\u2013317. Springer, Heidelberg (2008)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-642-00982-2_18","volume-title":"LATA 2009","author":"B. Bollig","year":"2009","unstructured":"Bollig, B.: Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 212\u2013223. Springer, Heidelberg (2009)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/978-3-540-92182-0_77","volume-title":"Algorithms and Computation","author":"B. Bollig","year":"2008","unstructured":"Bollig, B., Klump, J.: New Results on the Most Significant Bit of Integer Multiplication. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 883\u2013894. Springer, Heidelberg (2008)"},{"key":"19_CR5","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.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Trans. on Computers"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R.E. Bryant","year":"1991","unstructured":"Bryant, R.E.: On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication. IEEE Trans. on Computers\u00a040, 205\u2013213 (1991)","journal-title":"IEEE Trans. on Computers"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Burch, J.R., Clarke, E.M., Long, D.E., Mc Millan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 States and Beyond. In: Proc. of Symposium on Logic in Computer Science, pp. 428\u2013439 (1990)","DOI":"10.1109\/LICS.1990.113767"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/3-540-52148-8_30","volume-title":"Automatic Verification Methods for Finite State Systems","author":"O. Coudert","year":"1990","unstructured":"Coudert, O., Berthet, C., Madre, J.C.: Verification of Synchronous Sequential Machines Based on Symbolic Execution. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 365\u2013373. Springer, Heidelberg (1990)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0028563","volume-title":"STACS 98","author":"J. Feigenbaum","year":"1998","unstructured":"Feigenbaum, J., Kannan, S., Vardi, M.V., Viswanathan, M.: Complexity of Problems on Graphs Represented as OBDDs. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 216\u2013226. Springer, Heidelberg (1998)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct Representations of Graphs. Information and Control\u00a056, 183\u2013198 (1983)","journal-title":"Information and Control"},{"key":"19_CR11","first-page":"573","volume-title":"Proc. of SODA","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing Strongly Connected Components in a Linear Number of Symbolic Steps. In: Proc. of SODA, pp. 573\u2013582. ACM Press, New York (2003)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00453-007-9079-5","volume":"50","author":"R. Gentilini","year":"2008","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Symbolic Graphs: Linear Solutions to Connectivity Related Problems. Algorithmica\u00a050, 120\u2013158 (2008)","journal-title":"Algorithmica"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008651924240","volume":"10","author":"G.D. Hachtel","year":"1997","unstructured":"Hachtel, G.D., Somenzi, F.: A Symbolic Algorithm for Maximum Flow in 0\u2009\u2212\u20091 Networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-51498-8_24","volume-title":"Fundamentals of Computation Theory","author":"S. Jukna","year":"1989","unstructured":"Jukna, S.: The Effect of Null-Chains on the Complexity of Contact Schemes. In: Csirik, J.A., Demetrovics, J., Gecseg, F. (eds.) FCT 1989. LNCS, vol.\u00a0380, pp. 246\u2013256. Springer, Heidelberg (1989)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(91)90021-S","volume":"86","author":"M. Krause","year":"1991","unstructured":"Krause, M., Meinel, C., Waack, S.: Separating the Eraser Turing Machine Classes L e , NL e , co-NL e and P e . Theoretical Computer Science\u00a086, 267\u2013275 (1991)","journal-title":"Theoretical Computer Science"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C.H. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C.H., Yannakakis, M.: A Note on Succinct Representations of Graphs. Information and Control\u00a071, 181\u2013185 (1986)","journal-title":"Information and Control"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-24618-3_26","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2004","unstructured":"Sawitzki, D.: Implicit Flow Maximization by Iterative Squaring. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 301\u2013313. Springer, Heidelberg (2004)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-540-30577-4_33","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2005","unstructured":"Sawitzki, D.: Lower Bounds on the OBDD Size of Graphs of Some Popular Functions. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 298\u2013309. Springer, Heidelberg (2005)"},{"key":"19_CR19","unstructured":"Sawitzki, D.: Algorithmik und Komplexit\u00e4t OBDD-repr\u00e4sentierter Graphen. PhD Thesis, University of Dortmund, in German (2006)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/11682462_71","volume-title":"LATIN 2006: Theoretical Informatics","author":"D. Sawitzki","year":"2006","unstructured":"Sawitzki, D.: Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 781\u2013792. Springer, Heidelberg (2006)"},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0020-0190(93)90256-9","volume":"48","author":"D. Sieling","year":"1993","unstructured":"Sieling, D., Wegener, I.: NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Processing Letters\u00a048, 139\u2013144 (1993)","journal-title":"Parallel Processing Letters"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams \u2013 Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719789"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P. Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic Topological Sorting with OBDDs. Journal of Discrete Algorithms\u00a04(1), 51\u201371 (2006)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:27:02Z","timestamp":1739467622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}