{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:17:58Z","timestamp":1777940278369,"version":"3.51.4"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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,2]]},"DOI":"10.1016\/0020-0190(94)90093-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"151-155","source":"Crossref","is-referenced-by-count":23,"title":["Size-depth tradeoffs for Boolean formulae"],"prefix":"10.1016","volume":"49","author":[{"given":"Maria Luisa","family":"Bonet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel R.","family":"Buss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90093-0_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)90093-0_BIB2","first-page":"334","article-title":"Size-depth tradeoffs for algebraic formulae","author":"Bshouty","year":"1991","journal-title":"Proc. 32th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90093-0_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/FOCS.1965.14","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965","journal-title":"Proc. 6th Ann. IEEE Symp. on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0020-0190(94)90093-0_BIB4","first-page":"525","article-title":"On time hardware complexity tradeoffs for Boolean functions","author":"Spira","year":"1971","journal-title":"Proc. 4th Hawaii Internat. Symp. on System Sciences"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:29:18Z","timestamp":1555129758000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900930"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90093-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}