{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:10:08Z","timestamp":1736104208031,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023461","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"213-224","source":"Crossref","is-referenced-by-count":0,"title":["A reducibility concept for problems defined in terms of ordered binary decision diagrams"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Meinel","sequence":"first","affiliation":[]},{"given":"Anna","family":"Slobodov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"K. S. Brace, R. L. Rudell, R. E. Bryant: Efficient Implementation of a BDD Package, Proc. of 27th ACM\/IEEE Design Automation Conference, 1990, 40\u201345.","DOI":"10.1145\/123186.123222"},{"issue":"3","key":"18_CR2","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 Computing Surves, 24 (3), p. 293\u2013218, 1992.","journal-title":"ACM Computing Surves"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"R. E. Bryant: Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification. Proc. ICCAD'95.","DOI":"10.1109\/ICCAD.1995.480018"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill: Symbolic Model Checking: 1020 states and beyond, Proc. of 5th IEEE Symposium on Logic in Computer Science, 46\u201351, 1990.","DOI":"10.1145\/123186.123223"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"B. Bollig, I. Wegener: Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. Proc. STACS'96 (1996), 491\u2013502.","DOI":"10.1007\/3-540-60922-9_40"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, J. Gabarr\u00f3: Structural Complexity I., Springer 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"18_CR7","unstructured":"J. van Leeuwen: Handbook of Theoretical Computer Sci. MIT Press, 1990."},{"key":"18_CR8","first-page":"263","volume":"278","author":"K. Kriegel","year":"1987","unstructured":"K. Kriegel, S. Waack: Exponential Lower Bounds for Real-time Branching Programs. Proc. FCT'87, LNCS 278 (1987), 263\u2013367.","journal-title":"LNCS"},{"key":"18_CR9","first-page":"405","volume":"324","author":"M. Krause","year":"1988","unstructured":"M. Krause, Ch. Meinel, S. Waack: Separating the Eraser Turing Machine Classes L \u2208, NL \u2208, co and P \u2208. Proc. MFCS'88, LNCS 324 (1988), 405\u2013413.","journal-title":"LNCS"},{"key":"18_CR10","unstructured":"D. Long: BDD-Package, CMU."},{"key":"18_CR11","unstructured":"Ch. Meinel: Modified Branching Programs and Their Computational Power. LNCS 370, Springer Verlag, 1989."},{"key":"18_CR12","volume-title":"CUDD: CU Decision Diagram Package (Release 1.1.1)","author":"F. Somenzi","year":"1996","unstructured":"F. Somenzi: CUDD: CU Decision Diagram Package (Release 1.1.1). University of Colorado at Boulder. June 1996."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0020-0190(93)90256-9","volume":"48","author":"D. Sieling","year":"1993","unstructured":"D. Sieling, I. Wegener: Reduction of BDDs in linear time. Information Processing Letters 48 (1993) 139\u2013144.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:56:10Z","timestamp":1736103370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0023461","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}