{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:07:00Z","timestamp":1777540020374,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0304-3975(97)83807-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"47-60","source":"Crossref","is-referenced-by-count":22,"title":["Size of ordered binary decision diagrams representing threshold functions"],"prefix":"10.1016","volume":"180","author":[{"given":"K.","family":"Hosaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Takenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kaneda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Yajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)83807-8_BIB1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","article-title":"Binary Decision Diagrams","volume":"C-27","author":"Akers","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB2","article-title":"Variable Orderings for OBDDs, Simulated Annealing, and the Hidden Weighted Bit Function","author":"Bollig","year":"1994"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based Algorithms for Boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/12.73590","article-title":"On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication","volume":"C-40","author":"Bryant","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB5","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/12.53586","article-title":"Finding the Optimal Variable Ordering for Binary Decision Diagrams","volume":"C-39","author":"Friedman","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB6","series-title":"Proc. European Conf. on Design Automation","first-page":"50","article-title":"On variable ordering of binary decision diagrams for the application of multilevel logic synthesis","author":"Fujita","year":"1991"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB7","series-title":"Proc. Synthesis and Simulation Meeting and Internat. Interchange '92","first-page":"74","article-title":"Synthesis of Multi-level Logic Circuits from Binary Decision Diagrams","author":"Ishiura","year":"1992"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB8","series-title":"Proc. Internat. Conf. on Computer Aided Design","first-page":"472","article-title":"Minimization of binary decision diagrams based on exchanges of variables","author":"Ishiura","year":"1991"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB9","series-title":"Proc. Synthesis and Simulation Meeting and Internat. Interchange '90","first-page":"48","article-title":"A class of logic functions expressible by a polynomial-size binary decision diagram","author":"Ishiura","year":"1990"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB10","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/12.144618","article-title":"On the OBDD-representation of general Boolean functions","volume":"41","author":"Liaw","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB11","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/PGEC.1965.263958","article-title":"Lower Bounds of the number of threshold functions and a maximum weight","volume":"EC-14","author":"Muroga","year":"1965","journal-title":"IEEE Trans. Elect. Comput."},{"key":"10.1016\/S0304-3975(97)83807-8_BIB12","series-title":"Threshold Logic and its Applications","author":"Muroga","year":"1971"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB13","series-title":"Proc. Internat. Conf. on Computer Aided Design","first-page":"42","article-title":"Dynamic variable ordering for ordered binary decision diagram","author":"Rudell","year":"1993"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB14","article-title":"Computational power of binary decision diagrams","author":"Sawada","year":"1993"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB15","first-page":"611","article-title":"On the computational power of binary decision diagrams","volume":"E77-D","author":"Sawada","year":"1994","journal-title":"IEICE Trans. Inform. and Systems"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB16","series-title":"Proc. 4th Internat. Symp. on Algorithm and Computation","first-page":"389","article-title":"The complexity of the optimal variable ordering problems of shared binary decision diagrams","volume":"Vol. 762","author":"Tani","year":"1993"},{"key":"10.1016\/S0304-3975(97)83807-8_BIB17","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/PGEC.1965.264090","article-title":"A lower bound of the number of threshold functions","volume":"EC-14","author":"Yajima","year":"1965","journal-title":"IEEE Trans. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597838078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597838078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:36Z","timestamp":1556522736000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597838078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397597838078"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)83807-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}