{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:37Z","timestamp":1725455497910},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009489","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:32:17Z","timestamp":1129818737000},"page":"136-145","source":"Crossref","is-referenced-by-count":5,"title":["OBDDs of a monotone function and of its prime implicants"],"prefix":"10.1007","author":[{"given":"Kazuyoshi","family":"Hayase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1287\/opre.36.5.703","volume":"36","author":"M. O. Ball","year":"1988","unstructured":"M. O. Ball and J. S. Provan. Disjoint products and efficient computation of reliability. Operations Research, 36:703\u2013715, 1988.","journal-title":"Operations Research"},{"issue":"8","key":"14_CR2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR3","unstructured":"O. Coudert. Doing two-level logic minimization 100 times faster. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 112\u2013121, 1995."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"K. Hayase. On the complexity of constructing OBDDs of a monotone function and of the set of its prime implicants. Master's thesis, University of Tokyo, 1996. (available at http:\/\/naomi.is.s.u-tokyo.ac.jp\/theses.html).","DOI":"10.1007\/BFb0009489"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BFb0030837","volume":"959","author":"K. Hayase","year":"1995","unstructured":"K. Hayase, K. Sadakane, and S. Tani. Output-size sensitiveness of OBDD construction through maximal independent set problem. In COCOON'95, Lecture Notes in Computer Science, volume 959, pages 229\u2013234, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-61332-3_140","volume":"1090","author":"H. Imai","year":"1996","unstructured":"H. Imai, S. Iwata, K. Sekine, and K. Yoshida. Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements and partial orders. In COCOON'96, Lecture Notes in Computer Science, volume 1090, pages 68\u201380, 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR7","unstructured":"H. Imai, K. Sekine, and K. Yoshida. Binary decision diagrams and generating functions of sets related to graphs and codes. In 9th Karuizawa Workshop on Circuits and Systems, pages 91\u201396, 1996."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346\u2013358, 1979.","journal-title":"SIAM J. Numer. Anal."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"S. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proc. 30th ACM\/IEEE DAC, pages 272\u2013277, 1993.","DOI":"10.1145\/157485.164890"},{"key":"14_CR10","unstructured":"J. Niwa, K. Sadakane, K. Hayase, and H. Imai. Parallel top-down construction of OBDDs of monotone functions. In JSPP'96, Joint Symposium on Parallel Processing, pages 161\u2013168, 1996. (in Japanese)."},{"key":"14_CR11","unstructured":"K. Sekine and H. Imai. A unified approach via BDD to the network reliability and path numbers. Technical Report 95-09, Department of Information Science, University of Tokyo, 1995."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BFb0015427","volume":"1004","author":"K. Sekine","year":"1995","unstructured":"K. Sekine, H. Imai, and S. Tani. Computing the Tutte polynomial of a graph of moderate size. In ISAAC'95, Lecture Notes in Computer Science, volume 1004, pages 224\u2013233, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/3-540-58325-4_225","volume":"834","author":"S. Tani","year":"1994","unstructured":"S. Tani and H. Imai. A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In ISAAC'94, Lecture Notes in Computer Science, volume 834, pages 575\u2013583, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR14","unstructured":"D. J. A. Welsh. Matroid Theory. Academic Press, 1976."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T11:12:59Z","timestamp":1586517179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0009489","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}