{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:02:36Z","timestamp":1775282556828,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90061-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"243-248","source":"Crossref","is-referenced-by-count":18,"title":["A direct version of Shamir and Snir's lower bounds on monotone circuit depth"],"prefix":"10.1016","volume":"49","author":[{"given":"Prasoon","family":"Tiwari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Tompa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90061-2_BIB1","first-page":"539","article-title":"Monotone circuits for connectivity require superlogarithmic depth","author":"Karchmer","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90061-2_BIB2","first-page":"410","article-title":"Lower bounds for non-commutative computation","author":"Nisan","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90061-2_BIB3","series-title":"Tech. Rept. IBM RC 6757","article-title":"Lower bounds on the number of multiplications and the number of additions in monotone computations","author":"Shamir","year":"1977"},{"key":"10.1016\/0020-0190(94)90061-2_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01744302","article-title":"On the depth complexity of formulas","volume":"13","author":"Shamir","year":"1980","journal-title":"J. Math. Systems Theory"},{"key":"10.1016\/0020-0190(94)90061-2_BIB5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90060-2","article-title":"Negation can be exponentially powerful","volume":"12","author":"Valiant","year":"1980","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900612?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900612?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:36Z","timestamp":1555144176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020019094900612"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90061-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}