{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:50:01Z","timestamp":1649022601726},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0022-0000(93)90039-y","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"405-423","source":"Crossref","is-referenced-by-count":8,"title":["Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC"],"prefix":"10.1016","volume":"47","author":[{"given":"Mario","family":"Szegedy","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90039-Y_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311 formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB2","series-title":"Proceedings, 21st ACM Symposium on the Theory of Computing","first-page":"1","article-title":"Multiparty protocols and logspace-hard pseudorandom sequences","author":"Babai","year":"1989"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB3","series-title":"Width-3 permutation branching programs","author":"Barrington","year":"1985"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB4","series-title":"Proceedings, 18th ACM Symposium on the Theory of Computing","first-page":"1","article-title":"Bounded-width polynomial size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB5","article-title":"Some problems involving Razborov-Smolenski polynomials","author":"Barrington","year":"1990"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB6","article-title":"The current state of circuit lower bounds","author":"Barrington","year":"1990"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB7","doi-asserted-by":"crossref","unstructured":"D. A. M. Barrington, H. Straubing, and D. Therien, Non-uniform automata over groups, Inform. and Comput., to appear.","DOI":"10.1007\/3-540-18088-5_13"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB8","series-title":"Structure in Complexity Theory: Fifth Annual Conference","article-title":"Extensions to Barrington's M-program model","author":"Bedard","year":"1990"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/0208009","article-title":"Lower bounds on synchronous combinational complexity","volume":"8","author":"Harper","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90039-Y_BIB11","series-title":"Proceedings, 18th ACM Symposium on the Theory of Computing","first-page":"6","article-title":"Improved lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB12","article-title":"Computational Limitations of Small Depth Circuits","author":"Hastad","year":"1988"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB13","article-title":"Communication Complexity: A Survey","author":"Lov\u00e1sz","year":"1989"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/BF01212963","article-title":"NC1: The automata-theoretic viewpoint","volume":"1","author":"McKenzie","year":"1991","journal-title":"Computational Complexity"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB15","unstructured":"P. Ragde and A. Wigderson, Linear-size constant depth polylog-threshold circuits, manuscript."},{"key":"10.1016\/0022-0000(93)90039-Y_BIB16_1","first-page":"598","article-title":"Lower bounds on the size of bounded depth networks over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Mat. Zametki"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB16_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB17","series-title":"Proceedings, 19th ACM Symposium on the Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(89)90172-5","article-title":"Lower bounds for synchronous circuits and planar circuits","volume":"30","author":"Tur\u00e1n","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90039-Y_BIB19","series-title":"On restricted Boolean circuits","author":"Tur\u00e1n","year":"1989"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB20","first-page":"183","article-title":"On the relationship between the circuit complexity of a Boolean function and the number of its subfunctions","volume":"26","author":"Uhlig","year":"1973","journal-title":"Probl. Cybernet."},{"key":"10.1016\/0022-0000(93)90039-Y_BIB21","unstructured":"D. Uhlig, Boolean functions with a great number of subfunctions and small complexity and depth, Ingenieurhochschule Mittweida, Platz der DSF 17, Mittweida 9250, Germany."},{"key":"10.1016\/0022-0000(93)90039-Y_BIB22","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB23","series-title":"Proceedings, 11th ACM Symposium on the Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/0022-0000(93)90039-Y_BIB24","series-title":"Proceedings, 26th IEEE Symposium on the Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390039Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390039Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:58:19Z","timestamp":1550325499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390039Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["002200009390039Y"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90039-y","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}