{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:10:01Z","timestamp":1746335401854,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_11","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"118-129","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Some Ordering Problems"],"prefix":"10.1007","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ejor.2012.04.015","volume":"222","author":"R. Berghammer","year":"2012","unstructured":"Berghammer, R., Bolus, S.: On the use of binary decision diagrams for solving problems on simple games. European Journal of Operational Research\u00a0222(3), 529\u2013541 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"11_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ipl.2009.01.005","volume":"109","author":"B. Bollig","year":"2009","unstructured":"Bollig, B.: On the size of (generalized) OBDDs for threshold functions. Inf. Process. Lett.\u00a0109(10), 499\u2013503 (2009)","journal-title":"Inf. Process. Lett."},{"key":"11_CR3","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-15240-5_21","volume-title":"Theoretical Computer Science","author":"B. Bollig","year":"2010","unstructured":"Bollig, B.: On symbolic representations of maximum matchings and (un)directed graphs. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 286\u2013300. Springer, Heidelberg (2010)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1051\/ita:1999108","volume":"33","author":"B. Bollig","year":"1999","unstructured":"Bollig, B., L\u00f6bbing, M., Sauerhoff, M., Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models. Theoretical Informatics and Applications\u00a033, 103\u2013115 (1999)","journal-title":"Theoretical Informatics and Applications"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00224-009-9217-3","volume":"47","author":"B. Bollig","year":"2010","unstructured":"Bollig, B., Range, N., Wegener, I.: Exact OBDD bounds for some fundamental functions. Theory of Computing Systems\u00a047(2), 593\u2013609 (2010)","journal-title":"Theory of Computing Systems"},{"issue":"9","key":"11_CR6","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Computers\u00a045(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1006\/jcss.2000.1733","volume":"61","author":"B. Bollig","year":"2000","unstructured":"Bollig, B., Wegener, I.: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. Journal of Computing and System Science\u00a061(3), 558\u2013579 (2000)","journal-title":"Journal of Computing and System Science"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-20877-5_32","volume-title":"Theory and Applications of Models of Computation","author":"J. Brody","year":"2011","unstructured":"Brody, J., Matulef, K., Wu, C.: Lower bounds for testing computability by small width OBDDs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 320\u2013331. Springer, Heidelberg (2011)"},{"issue":"8","key":"11_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R. Bryant","year":"1991","unstructured":"Bryant, R.: On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Computers\u00a040, 205\u2013213 (1991)","journal-title":"IEEE Trans. Computers"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-08860-1_17","volume-title":"Automata, Languages and Programming","author":"F. Fortune","year":"1978","unstructured":"Fortune, F., Hopcroft, J., Schmidt, E.: The complexity of equivalence and containment for free single variable program schemes. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 227\u2013240. Springer, Heidelberg (1978)"},{"issue":"1","key":"11_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(1), 120\u2013158 (2008)","journal-title":"Algorithmica"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-45043-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Gill\u00e9","year":"2013","unstructured":"Gill\u00e9, M.: OBDD-based representation of interval graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 286\u2013297. Springer, Heidelberg (2013)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-642-15369-3_43","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"O. Goldreich","year":"2010","unstructured":"Goldreich, O.: On testing computability by small width OBDDs. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 574\u2013587. Springer, Heidelberg (2010)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008651924240","volume":"10","author":"G. Hachtel","year":"1997","unstructured":"Hachtel, G., Somenzi, F.: A symbolic algorithm for maximum flow in 0-1 networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.disc.2008.01.022","volume":"309","author":"K. Meer","year":"2009","unstructured":"Meer, K., Rautenbach, D.: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics\u00a0309(4), 843\u2013851 (2009)","journal-title":"Discrete Mathematics"},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1137\/S009753970038211X","volume":"31","author":"I. Newman","year":"2002","unstructured":"Newman, I.: Testing membership in languages that have small width branching programs. SIAM J. Comput.\u00a031(5), 1557\u20131570 (2002)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.dam.2008.02.012","volume":"157","author":"R. Nunkesser","year":"2009","unstructured":"Nunkesser, R., Woelfel, P.: Representations of graphs by OBDDs. Discrete Applied Mathematics\u00a0157(2), 247\u2013261 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of very large binary-decision diagrams. In: ICCAD, pp. 48\u201355 (1993)","DOI":"10.1109\/ICCAD.1993.580030"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2011.11.007","volume":"420","author":"D. Ron","year":"2012","unstructured":"Ron, D., Tsur, G.: Testing computability by width-two OBDDs. Theor. Comput. Sci.\u00a0420, 64\u201379 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/11611257_45","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2006","unstructured":"Sawitzki, D.: The complexity of problems on implicitly represented inputs. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 471\u2013482. Springer, Heidelberg (2006)"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.2001.3076","volume":"172","author":"D. Sieling","year":"2002","unstructured":"Sieling, D.: The nonapproximability of OBDD minimization. Information and Computation\u00a0172(2), 103\u2013138 (2002)","journal-title":"Information and Computation"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626493000022","volume":"3","author":"D. Sieling","year":"1993","unstructured":"Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters\u00a03, 3\u201312 (1993)","journal-title":"Parallel Processing Letters"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-57568-5_270","volume-title":"Algorithms and Computation","author":"S. Tani","year":"1993","unstructured":"Tani, S., Hamagushi, K., Yajima, S.: The complexity of the optimal variable ordering problems of a shared binary decision diagram. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 389\u2013396. Springer, Heidelberg (1993)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams: theory and applications. SIAM (2000)","DOI":"10.1137\/1.9780898719789"},{"issue":"11","key":"11_CR26","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1109\/12.324559","volume":"43","author":"I. Wegener","year":"1994","unstructured":"Wegener, I.: The size of reduced OBDDs and optimal read-once branching programs for almost all boolean functions. IEEE Trans. Computers\u00a043(11), 1262\u20131269 (1994)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"11_CR27","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. J. Discrete Algorithms\u00a04(1), 51\u201371 (2006)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:30:21Z","timestamp":1746333021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}