{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:41Z","timestamp":1725893981971},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_15","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"124-135","source":"Crossref","is-referenced-by-count":5,"title":["On Threshold BDDs and the Optimal Variable Ordering Problem"],"prefix":"10.1007","author":[{"given":"Markus","family":"Behle","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/11427186_39","volume-title":"Experimental and Efficient Algorithms","author":"B. Becker","year":"2005","unstructured":"Becker, B., Behle, M., Eisenbrand, F., Wimmer, R.: BDDs in a branch and cut framework. In: Nikoletseas, S. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 452\u2013463. Springer, Heidelberg (2005)"},{"key":"15_CR2","unstructured":"Behle, M.: Another Zero One Vertex Enumeration tool Homepage (2007), \n                    \n                      http:\/\/www.mpi-inf.mpg.de\/~behle\/azove.html"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with BDDs. In: Workshop on Algorithm Engineering and Experiments (ALENEX 2007), New Orleans (to appear, January 2007)","DOI":"10.1137\/1.9781611972870.15"},{"issue":"9","key":"15_CR4","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 Transactions on Computers\u00a045(9), 993\u20131002 (1996)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR6","first-page":"143","volume":"49","author":"M. Buro","year":"1993","unstructured":"Buro, M., Kleine B\u00fcning, H.: Report on a SAT competition. Bulletin of the European Association for Theoretical Computer Science\u00a049, 143\u2013151 (1993)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"12","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/TCAD.2003.819427","volume":"22","author":"R. Ebendt","year":"2003","unstructured":"Ebendt, R., G\u00fcnther, W., Drechsler, R.: An improved branch and bound algorithm for exact BDD minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a022(12), 1657\u20131663 (2003)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/37888.37941","volume-title":"Proceedings of the 24th ACM\/IEEE Design Automation Conference","author":"S. Friedman","year":"1987","unstructured":"Friedman, S., Supowit, K.: Finding the optimal variable ordering for binary decision diagrams. In: Proceedings of the 24th ACM\/IEEE Design Automation Conference, pp. 348\u2013356. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"15_CR9","first-page":"283","volume-title":"Satisfiability in the year 2000","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: Gent, I.P., Walsh, T. (eds.) Satisfiability in the year 2000, pp. 283\u2013292. IOS Press, Amsterdam (2000)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)83807-8","volume":"180","author":"K. Hosaka","year":"1997","unstructured":"Hosaka, K., Takenaga, Y., Kaneda, T., Yajima, S.: Size of ordered binary decision diagrams representing threshold functions. Theoretical Computer Science\u00a0180, 47\u201360 (1997)","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C.Y. Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. The Bell Systems Technical Journal\u00a038, 985\u2013999 (1959)","journal-title":"The Bell Systems Technical Journal"},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58940-9","volume-title":"Algorithms and Data Structures in VLSI Design","author":"C. Meinel","year":"1998","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design. Springer, Heidelberg (1998)"},{"key":"15_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"15_CR14","unstructured":"Somenzi, F.: CU Decision Diagram Package Release 2.4.1 Homepage. Department of Electrical and Computer Engineering, University of Colorado at Boulder (May 2005), \n                    \n                      http:\/\/vlsi.colorado.edu\/~fabio\/CUDD"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. Journal of the ACM\u00a034(1), 209\u2013219 (1987)","journal-title":"Journal of the ACM"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA (2000)","DOI":"10.1137\/1.9780898719789"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. LNCS. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:37Z","timestamp":1619517097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}