{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:38:43Z","timestamp":1648510723256},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0020-0190(94)00048-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"317-322","source":"Crossref","is-referenced-by-count":5,"title":["On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs"],"prefix":"10.1016","volume":"50","author":[{"given":"Jordan","family":"Gergov","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Meinel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0020-0190(94)00048-4_BIB1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","article-title":"Binary decision diagrams","volume":"27","author":"Akers","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)00048-4_BIB2","unstructured":"J. Bern, J. Gergov, Ch. Meinel and A. Slobodova, Boolean manipulation with Free BDD's, in: Proc. EDAC'94, to appear."},{"issue":"2","key":"10.1016\/0020-0190(94)00048-4_BIB3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","article-title":"Equivalence of free Boolean graphs can be decided probabilistically in polynomial time","volume":"10","author":"Blum","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00048-4_BIB4","article-title":"The size of binary decision diagrams representing Boolean functions","author":"Breitbart","year":"1991","journal-title":"Manuscript"},{"issue":"8","key":"10.1016\/0020-0190(94)00048-4_BIB5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput"},{"key":"10.1016\/0020-0190(94)00048-4_BIB6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/123186.123223","article-title":"Sequential circuit verification using symbolic model checking","author":"Burch","year":"1990","journal-title":"Proc. 2th IEEE DAC'90"},{"key":"10.1016\/0020-0190(94)00048-4_BIB7","series-title":"Proc. of computer-aided verification","first-page":"75","article-title":"Verifying temporal properties of sequential machines without building their state diagrams","author":"Coudert","year":"1990"},{"key":"10.1016\/0020-0190(94)00048-4_BIB8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-08860-1_17","article-title":"The complexity of equivalence and containment for free single variable program schemes","volume":"62","author":"Fortune","year":"1978"},{"key":"10.1016\/0020-0190(94)00048-4_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(94)00048-4_BIB10","series-title":"Tech. Rept. 92-10","article-title":"Efficient analysis and manipulation of OBDD's can be extended to read-once-only branching programs","author":"Gergov","year":"1992"},{"key":"10.1016\/0020-0190(94)00048-4_BIB11","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Representation of switching circuits by binary decision programs","volume":"38","author":"Lee","year":"1959","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/0020-0190(94)00048-4_BIB12","article-title":"Modified Branching Programs and Their Computational Power","volume":"370","author":"Meinel","year":"1989"},{"key":"10.1016\/0020-0190(94)00048-4_BIB13","series-title":"Branching programs \u2014 An efficient data structure for computer-aided circuit design","author":"Meinel","year":"1991"},{"key":"10.1016\/0020-0190(94)00048-4_BIB14","article-title":"Graph-driven BDDs - A new data structure for Boolean functions","author":"Sieling","year":"1992","journal-title":"Manuscript"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:53Z","timestamp":1555145453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0020019094000484"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00048-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}