{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:34:41Z","timestamp":1648582481917},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00264-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"155-157","source":"Crossref","is-referenced-by-count":10,"title":["An exponential gap with the removal of one negation gate"],"prefix":"10.1016","volume":"82","author":[{"given":"Shao-Chin","family":"Sung","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0020-0190(01)00264-2_BIB001","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":"1","key":"10.1016\/S0020-0190(01)00264-2_BIB002","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"},{"issue":"3","key":"10.1016\/S0020-0190(01)00264-2_BIB003","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":"1","key":"10.1016\/S0020-0190(01)00264-2_BIB004","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02122563","article-title":"The gap between monotone and non-monotone circuit complexity is exponential","volume":"8","author":"Tardos","year":"1988","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0020-0190(01)00264-2_BIB005","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"},{"key":"10.1016\/S0020-0190(01)00264-2_BIB006","series-title":"Lecture Notes in Computer Science 33 \u2014 Automata Theory and Formal Languages, 2nd GI Conference","first-page":"71","article-title":"The complexity of negation-limited networks \u2014 A brief survey","author":"Fischer","year":"1974"},{"key":"10.1016\/S0020-0190(01)00264-2_BIB007","series-title":"Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV","first-page":"585","article-title":"More on the complexity of negation-limited circuits","author":"Beals","year":"1995"},{"key":"10.1016\/S0020-0190(01)00264-2_BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"10.1016\/S0020-0190(01)00264-2_BIB009","first-page":"1355","article-title":"A relationship between the number of negations and the circuit size","volume":"E79-D","author":"Tanaka","year":"1996","journal-title":"IEICE Trans. Inform. Systems"},{"key":"10.1016\/S0020-0190(01)00264-2_BIB010","unstructured":"M.J. Fischer, Lectures on network complexity, Tech. Rept. YALEU\/DCS\/TR-1104, Department of Computer Science, Yale University, June 1974, revised April 1977, April 1996"},{"issue":"5","key":"10.1016\/S0020-0190(01)00264-2_BIB011","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0020-0190(96)00115-9","article-title":"Negation-limited circuit complexity of symmetric functions","volume":"59","author":"Tanaka","year":"1996","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:52:35Z","timestamp":1556776355000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002642"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00264-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}