{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:14:30Z","timestamp":1672240470662},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00215-9","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T16:05:14Z","timestamp":1035821114000},"page":"3-8","source":"Crossref","is-referenced-by-count":15,"title":["On the negation-limited circuit complexity of merging"],"prefix":"10.1016","volume":"126","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Tarui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00215-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(nlogn) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/S0166-218X(02)00215-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\/S0166-218X(02)00215-9_BIB3","unstructured":"K. Amano, A. Maruoka, A superpolynomial lower bound for a circuit computing the clique function with (1\/6)loglogn negation gates, Proceedings of the 23rd MFCS, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 399\u2013408."},{"issue":"3","key":"10.1016\/S0166-218X(02)00215-9_BIB4","first-page":"530","article-title":"On a method for obtaining lower bounds for the complexity of individual monotone functions","volume":"31","author":"Andreev","year":"1985","journal-title":"Soviet Math. Dokl."},{"issue":"5","key":"10.1016\/S0166-218X(02)00215-9_BIB5","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1137\/S0097539794275136","article-title":"On the complexity of negation-limited Boolean networks","volume":"27","author":"Beals","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00215-9_BIB6","unstructured":"S.J. Berkowitz, On some relationships between monotone and non-monotone circuit complexity, Technical Report, University of Toronto, 1982."},{"key":"10.1016\/S0166-218X(02)00215-9_BIB7","doi-asserted-by":"crossref","unstructured":"R.B. Boppana, M. Sipser, The complexity of finite functions, Handbook of Theoretical Computer Science, Elsevier Science, Amsterdam, 1990, pp. 757\u2013804.","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"10.1016\/S0166-218X(02)00215-9_BIB8","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, The complexity of negation-limited networks\u2014a brief survey, Lecture Notes in Computer Science, Vol. 33, Springer, Berlin, 1974, pp. 71\u201382.","DOI":"10.1007\/3-540-07407-4_9"},{"key":"10.1016\/S0166-218X(02)00215-9_BIB9","unstructured":"D.E. Knuth, The art of computer programming, Sorting and Searching, 2nd Edition, Vol. 3, Addison-Wesley, Reading, MA, 1998."},{"key":"10.1016\/S0166-218X(02)00215-9_BIB10","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\/S0166-218X(02)00215-9_BIB11","doi-asserted-by":"crossref","unstructured":"A.A. Razborov, On the method of approximations, Proceedings of the 21st STOC, 1989, pp. 167\u2013176.","DOI":"10.1145\/73007.73023"},{"issue":"4","key":"10.1016\/S0166-218X(02)00215-9_BIB12","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:37:52Z","timestamp":1580895472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002159"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00215-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}