{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T02:46:29Z","timestamp":1773542789404,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0166-218x(91)90032-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"51-69","source":"Crossref","is-referenced-by-count":28,"title":["The threshold order of a Boolean function"],"prefix":"10.1016","volume":"31","author":[{"given":"Chi","family":"Wang","sequence":"first","affiliation":[]},{"given":"A.C.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90032-R_BIB1","first-page":"145","article-title":"Aggregation of inequalities in integer programming","volume":"1","author":"Chv\u00e1tal","year":"1977"},{"key":"10.1016\/0166-218X(91)90032-R_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(87)90056-4","article-title":"Dualization of regular Boolean functions","volume":"16","author":"Crama","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(91)90032-R_BIB3","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(91)90032-R_BIB4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TC.1979.1675324","article-title":"An algorithm to dualize a regular switching function","volume":"28","author":"Hammer","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90032-R_BIB5","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer","year":"1968"},{"key":"10.1016\/0166-218X(91)90032-R_BIB6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","article-title":"On defining sets of vertices of the hypercube by linear inequalities","volume":"11","author":"Jeroslow","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(91)90032-R_BIB7","series-title":"Threshold Logic and Its Applications","author":"Muroga","year":"1971"},{"key":"10.1016\/0166-218X(91)90032-R_BIB8_1","series-title":"Tech. Rept. 245","article-title":"Enumeration of threshold functions of eight variables","author":"Muroga","year":"1967"},{"key":"10.1016\/0166-218X(91)90032-R_BIB8_2","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/T-C.1970.223046","article-title":"Enumeration of threshold functions of eight variables","volume":"9","author":"Muroga","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90032-R_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","article-title":"Polynomial-time algorithms for regular set-covering and threshold synthesis","volume":"12","author":"Peled","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(91)90032-R_BIB10","series-title":"Threshold Logic","author":"Sheng","year":"1969"},{"key":"10.1016\/0166-218X(91)90032-R_BIB11","series-title":"Tech. Rept. RRR 62-88","article-title":"The threshold order of a Boolean function","author":"Wang","year":"1988"},{"key":"10.1016\/0166-218X(91)90032-R_BIB12","series-title":"Tech. Rept. RRR 40-88","article-title":"Extrapolation of partially defined Boolean functions by linear programming","author":"Williams","year":"1988"},{"key":"10.1016\/0166-218X(91)90032-R_BIB13","series-title":"Ph.D. Thesis","article-title":"Threshold logic","author":"Winder","year":"1962"},{"key":"10.1016\/0166-218X(91)90032-R_BIB14","series-title":"Applied Automata Theory","first-page":"236","article-title":"The fundamentals of threshold logic","author":"Winder","year":"1968"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190032R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190032R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:27Z","timestamp":1555135107000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190032R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0166218X9190032R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90032-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}