{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:39:23Z","timestamp":1720201163101},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90209-9","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T03:31:32Z","timestamp":1060313492000},"page":"55-68","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["On the complexity of slice functions"],"prefix":"10.1016","volume":"38","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90209-9_BIB1","series-title":"Proc. 15th STOC","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0304-3975(85)90209-9_BIB2","article-title":"On some relationships between monotone and non-monotone circuit complexity","author":"Berkowitz","year":"1982"},{"key":"10.1016\/0304-3975(85)90209-9_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02241983","article-title":"Monotone switching circuits and Boolean matrix product","volume":"16","author":"Mehlhorn","year":"1976","journal-title":"Computing"},{"key":"10.1016\/0304-3975(85)90209-9_BIB4","first-page":"236","article-title":"On a Boolean matrix","volume":"21","author":"Nechiporuk","year":"1971","journal-title":"Systems Res. Theory"},{"key":"10.1016\/0304-3975(85)90209-9_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01768483","article-title":"The complexity of monotone Boolean functions","volume":"11","author":"Pippenger","year":"1978","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/0304-3975(85)90209-9_BIB6","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0304-3975(85)90209-9_BIB7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Systems Techn. J."},{"key":"10.1016\/0304-3975(85)90209-9_BIB8","series-title":"Proc. 15th STOC","first-page":"110","article-title":"Exponential lower bounds for restricted monotone circuits","author":"Valiant","year":"1983"},{"key":"10.1016\/0304-3975(85)90209-9_BIB9","series-title":"Techn. Rept.","article-title":"Negation is powerless for Boolean slice functions","author":"Valiant","year":"1984"},{"key":"10.1016\/0304-3975(85)90209-9_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(89)90084-4","article-title":"Boolean functions whose monotone complexity is of size n2log n","volume":"21","author":"Wegener","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90209-9_BIB11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0019-9958(83)80035-7","article-title":"An \u03c9(n32) lower bound on the monotone complexity of Boolean convolution","volume":"59","author":"Weiss","year":"1983","journal-title":"Inform. Control."},{"key":"10.1016\/0304-3975(85)90209-9_BIB12","series-title":"Proc. 24th FOCS","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:00:26Z","timestamp":1552593626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585902099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":12,"alternative-id":["0304397585902099"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90209-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}