{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T13:12:05Z","timestamp":1772975525717,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf01744302","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T08:45:05Z","timestamp":1118911505000},"page":"301-322","source":"Crossref","is-referenced-by-count":31,"title":["On the depth complexity of formulas"],"prefix":"10.1007","volume":"13","author":[{"given":"Eli","family":"Shamir","sequence":"first","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01744302_CR1","first-page":"83","volume-title":"Complexity of Sequential and Parallel Numerical Algorithms","author":"R. P. Brent","year":"1973","unstructured":"R. P. Brent, The parallel evaluation of arithmetic expressions in logarithmic time,Complexity of Sequential and Parallel Numerical Algorithms, J. F. Traub (ed.), Academic Press, New York, 83\u2013102 (1973)."},{"key":"BF01744302_CR2","unstructured":"W. F. McColl, Some results on circuit depth. Ph. D. Thesis, Univ. of Warwick, 1977."},{"key":"BF01744302_CR3","first-page":"108","volume":"17","author":"W. F. McColl","year":"1978","unstructured":"W. F. McColl, The circuit depth of symmetric Boolean functions,JCSS 17, 108\u2013115 (1978).","journal-title":"JCSS"},{"key":"BF01744302_CR4","unstructured":"G. B. Goodrich, R. E. Ladner, and M. J. Fischer, Straight-line programs to compute finite languages, Proc. of a conference on Theoretical Computer Science, Univ. of Waterloo, 221\u2013229 (1977)."},{"key":"BF01744302_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/0204009","volume":"4","author":"W. Miller","year":"1975","unstructured":"W. Miller, Computational complexity and numerical stability,SIAM J. Computing 4, 97\u2013107 (1975).","journal-title":"SIAM J. Computing"},{"key":"BF01744302_CR6","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1145\/321906.321916","volume":"22","author":"W. Miller","year":"1975","unstructured":"W. Miller, Computer search for numerical stability,J. ACM 22, 512\u2013521 (1975).","journal-title":"J. ACM"},{"key":"BF01744302_CR7","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1145\/321958.321973","volume":"23","author":"D. E. Muller","year":"1976","unstructured":"D. E. Muller and F. P. Preparata, Restructuring of arithmetic expressions for parallel evaluation,J. ACM 23, 534\u2013543 (1976)","journal-title":"J. ACM"},{"key":"BF01744302_CR8","unstructured":"N. Pippenger, Short monotone formulae for threshold functions,IBM Tech. Rep. RC 5405, 1975."},{"key":"BF01744302_CR9","unstructured":"E. Shamir and M. Snir, Lower bounds on the number of multiplications and the number of additions in monotone computations,IBM Tech. Rep. RC 6757, 1977."},{"key":"BF01744302_CR10","unstructured":"E. Shamir and M. Snir, Lower bounds on depth complexity in monotone arithmetic computations,IBM Tech. Rep. RC 7055, 1978."},{"key":"BF01744302_CR11","unstructured":"M. Snir, On the complexity of formula simplification, in preparation."},{"key":"BF01744302_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant, The complexity of computing the permanent,Theor. Comp. Sci. 8, 189\u2013201 (1979).","journal-title":"Theor. Comp. Sci."},{"key":"BF01744302_CR13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0208010","volume":"8","author":"L. Hyafil","year":"1979","unstructured":"L. Hyafil, On the parallel evaluation of multivariate polynomials,SIAM J. Computing 8, 120\u2013123 (1979).","journal-title":"SIAM J. Computing"},{"key":"BF01744302_CR14","first-page":"466","volume-title":"The parallel complexity of arithmetic computations, Proceedings of the 1977 International FCT-Conference on Fundamentals of Computations Theory","author":"J. I. Munro","year":"1977","unstructured":"J. I. Munro, The parallel complexity of arithmetic computations, Proceedings of the 1977 International FCT-Conference on Fundamentals of Computations Theory, M. Karpinski (ed.) Springer, Berlin, 466\u2013475 (1977)."},{"key":"BF01744302_CR15","unstructured":"M. Snir, On the size of monotone formulas,Univ. of Edinburgh Tech. Rep. CSR-46-79, 1979."},{"key":"BF01744302_CR16","doi-asserted-by":"crossref","unstructured":"H. J. Ryser, Combinatorial mathematics, Carus Math. Monograph No. 14 (1963).","DOI":"10.5948\/UPO9781614440147"},{"key":"BF01744302_CR17","unstructured":"M. Jerrum and M. Snir, Some exact complexity results for straight-line computations over semirings, Univ of Edinburgh CRS-58-80, 1980."},{"key":"BF01744302_CR18","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csansky","year":"1976","unstructured":"L. Csansky, Fast parallel matrix inversion algorithms,SIAM J. Comput. 5, 618\u2013623 (1976).","journal-title":"SIAM J. Comput."},{"key":"BF01744302_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","volume":"22","author":"D. E. Muller","year":"1975","unstructured":"D. E. Muller and F. P. Preparata, Bounds to complexities of networks for sorting and switching,J. ACM 22, 195\u2013201 (1975).","journal-title":"J. ACM"},{"key":"BF01744302_CR20","unstructured":"L. Valiant, private communication."},{"key":"BF01744302_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00264580","volume":"12","author":"B. Commentz-Walter","year":"1979","unstructured":"B. Commentz-Walter, Size-depth tradeoff in monotone Boolean formulae,Acta Informat. 12, 227\u2013243 (1979).","journal-title":"Acta Informat."},{"key":"BF01744302_CR22","doi-asserted-by":"crossref","unstructured":"B. Commentz-Walter and J. Sattler, Size-depth tradeoff in non-monotone Boolean formulae,Acta Informat. (in press) (1980).","DOI":"10.1007\/BF00264256"},{"key":"BF01744302_CR23","first-page":"1149","volume":"14","author":"L. S. Khasin","year":"1970","unstructured":"L. S. Khasin, Complexity bounds for the realization of monotonic symmetric functions.Sov. Phys. Dokl, 14, 1149\u20131151 (1970), orig. inDok. Akad. Nauk SSSR 189, 752\u2013755 (1969).","journal-title":"Sov. Phys. Dokl"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744302.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01744302\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:25:07Z","timestamp":1586287507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01744302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01744302"],"URL":"https:\/\/doi.org\/10.1007\/bf01744302","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}