{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:37Z","timestamp":1759637977151},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"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":13468,"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":[[1976,9]]},"DOI":"10.1016\/0304-3975(76)90083-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"305-315","source":"Crossref","is-referenced-by-count":40,"title":["A lower bound on the number of additions in monotone computations"],"prefix":"10.1016","volume":"2","author":[{"given":"C.P.","family":"Schnorr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90083-9_BIB1","first-page":"151","article-title":"The complexity of theorem-proving procedure","author":"Cook","year":"1971","journal-title":"Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90083-9_BIB2","article-title":"Lectures on network complexity","author":"Fischer","year":"1974","journal-title":"Preprint Universit\u00e4t Frankfurt"},{"key":"10.1016\/0304-3975(76)90083-9_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(76)90083-9_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(75)90009-2","article-title":"Complexity of monotone networks for Boolean matrix product","volume":"1","author":"Paterson","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(76)90083-9_BIB5","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr, The network complexity and the Turing machine complexity of finite functions, Acta Informat., to appear.","DOI":"10.1007\/BF00265223"},{"key":"10.1016\/0304-3975(76)90083-9_BIB6","article-title":"A lower bound on the number of additions in monotone computations of monotone rational polynomials","author":"Schnorr","year":"1974","journal-title":"Preprint Universit\u00e4t Frankfurt"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900839?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900839?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:21:20Z","timestamp":1555125680000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["0304397576900839"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90083-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}