{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:06:23Z","timestamp":1649127983659},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0304-3975(96)00007-2","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"283-289","source":"Crossref","is-referenced-by-count":0,"title":["On a small class of Boolean sums"],"prefix":"10.1016","volume":"163","author":[{"given":"Tatsuie","family":"Tsukiji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00007-2_BIB1","article-title":"The Probablistic Methods","author":"Alon","year":"1991","journal-title":"Wiley-Interscience Series in Disc. Math. and Opt."},{"key":"10.1016\/0304-3975(96)00007-2_BIB2_1","first-page":"97","article-title":"On a family of Boolean matrices","volume":"41","author":"Andreev","year":"1986","journal-title":"Vestnik Moskov. Univ. Mat."},{"key":"10.1016\/0304-3975(96)00007-2_BIB2_2","first-page":"79","volume":"41","author":"Andreev","year":"1986","journal-title":"Moscow. Univ. Math. Bull."},{"key":"10.1016\/0304-3975(96)00007-2_BIB3","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0304-3975(96)00007-2_BIB4","series-title":"Combinatorics","author":"Bollob\u00e1s","year":"1986"},{"key":"10.1016\/0304-3975(96)00007-2_BIB5","series-title":"The Complexity of Boolean Networks","author":"Dunne","year":"1988"},{"key":"10.1016\/0304-3975(96)00007-2_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00268321","article-title":"Some remarks on Boolean Sums","volume":"12","author":"Mehlhorn","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(96)00007-2_BIB7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(80)90034-1","article-title":"On another Boolean matrix","volume":"11","author":"Pippenger","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)00007-2_BIB8","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987","journal-title":"Wiley-Teubner Series in Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000072?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:24:30Z","timestamp":1556522670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397596000072"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00007-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}