{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:54Z","timestamp":1763467494220},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90029-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"337-345","source":"Crossref","is-referenced-by-count":76,"title":["A Boolean function requiring 3n network size"],"prefix":"10.1016","volume":"28","author":[{"given":"Norbert","family":"Blum","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90029-4_BIB1","series-title":"Tech. Rept. A 81\/05","article-title":"A 2.75n-lower bound on the network complexity of boolean functions","author":"Blum","year":"1981"},{"key":"10.1016\/0304-3975(83)90029-4_BIB2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0206030","article-title":"A 2.5n-lower bound on the combinational complexity of boolean functions","volume":"6","author":"Paul","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90029-4_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02246615","article-title":"Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen","volume":"13","author":"Schnorr","year":"1974","journal-title":"Computing"},{"key":"10.1016\/0304-3975(83)90029-4_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90074-2","article-title":"A 3n-lower bound on the network complexity of boolean functions","volume":"10","author":"Schnorr","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90029-4_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01683282","article-title":"On the combinational complexity of certain symmetric Boolean functions","volume":"10","author":"Stockmeyer","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(83)90029-4_BIB6","doi-asserted-by":"crossref","unstructured":"I. Wegener, Private communication, 1981.","DOI":"10.1007\/BF02606447"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:19Z","timestamp":1555127419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900294"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90029-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}