{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T19:28:13Z","timestamp":1769628493728,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":8386,"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":[[1990,8]]},"DOI":"10.1016\/0304-3975(90)90080-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"313-323","source":"Crossref","is-referenced-by-count":25,"title":["Lower bounds to the complexity of symmetric Boolean functions"],"prefix":"10.1016","volume":"74","author":[{"given":"L.","family":"Babai","sequence":"first","affiliation":[]},{"given":"P.","family":"Pudl\u00e1k","sequence":"additional","affiliation":[]},{"given":"V.","family":"R\u00f6dl","sequence":"additional","affiliation":[]},{"given":"E.","family":"Szemeredi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90080-2_BIB1","first-page":"30","article-title":"Two lower bounds for branching programs","author":"Ajtai","year":"1986","journal-title":"Proc. 18th ACM STOC"},{"key":"10.1016\/0304-3975(90)90080-2_BIB2","first-page":"410","article-title":"Ramsey theory and lower bounds for branching programs","author":"Alon","year":"1986","journal-title":"Proc. 27th FOCS"},{"issue":"3","key":"10.1016\/0304-3975(90)90080-2_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0211033","article-title":"\u03a9(n log n) lower bounds on the length of Boolean formulas","volume":"11","author":"Fischer","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90080-2_BIB4","first-page":"83","article-title":"On the problem of realization of symmetric Boolean functions by contact schemes","volume":"15","author":"Lupanov","year":"1965","journal-title":"Probl. Kibernet."},{"issue":"4","key":"10.1016\/0304-3975(90)90080-2_BIB5","first-page":"765","article-title":"On a Boolean function","volume":"169","author":"Ne\u010diporuk","year":"1966","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0304-3975(90)90080-2_BIB6","series-title":"Technical Report 78-03-02","article-title":"An upper bound on the size of formulae for symmetric Boolean functions","author":"Peterson","year":"1978"},{"key":"10.1016\/0304-3975(90)90080-2_BIB7","series-title":"Lectures Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/BFb0030331","article-title":"A lower bound to the complexity of branching programs","volume":"176","author":"Pudl\u00e1k","year":"1984"},{"key":"10.1016\/0304-3975(90)90080-2_BIB8","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900802?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900802?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:51:58Z","timestamp":1555127518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590900802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0304397590900802"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90080-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}