{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T15:02:25Z","timestamp":1703084545348},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00115-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"273-279","source":"Crossref","is-referenced-by-count":9,"title":["Negation-limited circuit complexity of symmetric functions"],"prefix":"10.1016","volume":"59","author":[{"given":"Keisuke","family":"Tanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuro","family":"Nishino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Beals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00115-9_BIB1_1","series-title":"Proc. 15th Ann. ACM Symp. on the Theory of Computing","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"issue":"1","key":"10.1016\/0020-0190(96)00115-9_BIB1_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/0020-0190(96)00115-9_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of Boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(96)00115-9_BIB3","series-title":"Proc. 27th Ann. ACM Symp. on the Theory of Computing","first-page":"585","article-title":"More on the complexity of negation-limited circuits","author":"Beals","year":"1995"},{"key":"10.1016\/0020-0190(96)00115-9_BIB4","first-page":"757","article-title":"The complexity of finite functions","volume":"Vol. A","author":"Boppana","year":"1990"},{"key":"10.1016\/0020-0190(96)00115-9_BIB5","first-page":"71","article-title":"The complexity of negation-limited networks \u2014 A brief survey","volume":"33","author":"Fischer","year":"1974"},{"key":"10.1016\/0020-0190(96)00115-9_BIB6","series-title":"Proc. 15th Ann. IEEE Symp. on Switching and Automata Theory","first-page":"140","article-title":"Combinational complexity of some monotone functions","author":"Lamagna","year":"1974"},{"key":"10.1016\/0020-0190(96)00115-9_BIB7","series-title":"The monotone circuit complexity of threshold functions","author":"Long","year":"1986"},{"key":"10.1016\/0020-0190(96)00115-9_BIB8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/320941.320945","article-title":"On the inversion complexity of a system of functions","volume":"5","author":"Markov","year":"1958","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0020-0190(96)00115-9_BIB9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/T-C.1972.223425","article-title":"Minimal negative gate networks","volume":"21","author":"Nakamura","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(96)00115-9_BIB10","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1145\/146637.146684","article-title":"Monotone circuits for matching require linear depth","volume":"39","author":"Raz","year":"1992","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0020-0190(96)00115-9_BIB11","first-page":"354","article-title":"Lower bounds for the monotone complexity of some Boolean functions","volume":"31","author":"Razborov","year":"1985","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"10.1016\/0020-0190(96)00115-9_BIB12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0222022","article-title":"Limiting negations in constant depth circuits","volume":"22","author":"Santha","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00115-9_BIB13","series-title":"Proc. 26th Ann. ACM Symp. on the Theory of Computing","first-page":"38","article-title":"On the complexity of negation limited Boolean networks","author":"Tanaka","year":"1994"},{"issue":"4","key":"10.1016\/0020-0190(96)00115-9_BIB14","first-page":"141","article-title":"The gap between monotone and non-monotone circuit complexity is exponential","volume":"7","author":"Tardos","year":"1987","journal-title":"Combinatorica"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:24:25Z","timestamp":1556043865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001159"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00115-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}