{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:39Z","timestamp":1725562779692},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642305"},{"type":"electronic","value":"9783540697053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028564","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:33:39Z","timestamp":1132644819000},"page":"227-237","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence test and ordering transformation for parity-OBDDs of different variable ordering"],"prefix":"10.1007","author":[{"given":"Jan","family":"Behrens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Waack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/43.486279","volume":"15","author":"J. Bern","year":"1996","unstructured":"J. Bern, C. Meinel, and A. Slobodov\u00e1. Global rebuilding of obdds avoiding memory requirement maxima, IEEE Trans. on Computers 1996, 15, 131\u2013134.","journal-title":"IEEE Trans. on Computers"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers 1986, 35, pp. 677\u2013691.","journal-title":"IEEE Trans. on Computers"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"R. E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comp. on Surveys 1992, 24, pp. 293\u2013318.","journal-title":"ACM Comp. on Surveys"},{"key":"22_CR4","unstructured":"B. Bollig, I. Wegener, Improving the variable ordering of OBDDs is NP-complete., Forschungsbericht Nr. 542 (1994) des Fachbereichs Informatik der Universit\u00e4t Dortmund."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computation 1990, 9, pp. 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"St. Fortune, J. Hopcroft, E. M. Schmidt, The complexity of equivalence and containment for free single variable program schemes, in: Proc. ICALP 1978, Lecture Notes in Computer Sci. 62, Springer-Verlag 1978, pp. 227\u2013240.","DOI":"10.1007\/3-540-08860-1_17"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00709139","volume":"8","author":"J. Gergov","year":"1996","unstructured":"J. Gergov, Ch. Meinel, Mod-2-OBDDs-a data structure that generalizes EXORSum-of-Products and Ordered Binary Decision Diagrams, Formal Methods in System Design 1996, 8, pp. 273\u2013282.","journal-title":"Formal Methods in System Design"},{"key":"22_CR8","unstructured":"J. van Leeuwen (edit.), Handbook of theoretical computer science, volume A, Elsevier Science Publishers B.V. 1992."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050083","volume":"34","author":"P. Savick\u00fd","year":"1997","unstructured":"P. Savick\u00fd and I. Wegener. Efficient algorithms for the transformation between different types of binary decision diagrams, Acta Informatica 1997 34. pp. 245\u2013256.","journal-title":"Acta Informatica"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0012-365X(95)90790-R","volume":"136","author":"I. Wegener","year":"1994","unstructured":"I. Wegener, Efficient data structures for Boolean functions, Discrete Mathematics 1994, 136, pp. 347\u2013372.","journal-title":"Discrete Mathematics"},{"key":"22_CR11","unstructured":"St. Waack, On the decriptive and algorithmic power of parity ordered binary decision diagrams, in: Proc. 14th STACS 1997, Lecture Notes in Computer Sci. 1200, Springer-Verlag 1997, pp. 201\u2013212."}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T21:56:56Z","timestamp":1552946216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0028564","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}