{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T21:53:48Z","timestamp":1718920428659},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"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":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00145-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"297-303","source":"Crossref","is-referenced-by-count":4,"title":["An exact characterization of symmetric functions in qAC0[2]"],"prefix":"10.1016","volume":"261","author":[{"given":"Chi-Jen","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00145-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u221111-formula on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB2","doi-asserted-by":"crossref","unstructured":"J. Aspnes, R. Beigel, M. Furst, S. Rudich, The expressive power of voting polynomials, Proc. 23rd Ann. ACM Symp. Theory of Computing, 1991, pp. 402\u2013409.","DOI":"10.1145\/103418.103461"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB3","doi-asserted-by":"crossref","unstructured":"D.A.M. Barrington, H. Straubing, Complex polynomials and circuit lower bounds for modular counting, Proc. 1st Latin American Symp. Theoretical Informatics, 1992, pp. 24\u201331.","DOI":"10.1007\/BFb0023814"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(87)90163-3","article-title":"The complexity of symmetric functions in bounded-depth circuits","volume":"25","author":"Brustmann","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00145-6_BIB5","unstructured":"C. Damm, K. Lenz, Symmetric functions in AC0[2], Forschungsbericht Mathematik\/Informatik Nr. 93-05, Universit\u00e4t Trier, Trier, 1993."},{"key":"10.1016\/S0304-3975(00)00145-6_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded depth, polynomial size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00145-6_BIB7","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. System Theory"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB8","doi-asserted-by":"crossref","unstructured":"F. Green, An oracle separating \u2295 P from PPPH, Proc. 5th Ann. Conf. Structure in Complexity Theory, 1990, pp. 295\u2013298.","DOI":"10.1109\/SCT.1990.113977"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB9","series-title":"Computational Limitations of Small-depth Circuits","author":"H\u00e5stad","year":"1986"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB10","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth with basis {\u2227, \u2295}","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB11","doi-asserted-by":"crossref","unstructured":"R. Smolensky, Algebraic methods in the theory of lower bounds for boolean circuit complexity, Proc. 19th Ann. ACM Symp. Theory of Computing, 1987, pp. 77\u201382.","DOI":"10.1145\/28395.28404"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB12","doi-asserted-by":"crossref","unstructured":"A.C.-C. Yao, Separating the polynomial-time hierachy by oracles, Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, 1985, pp. 1\u201310.","DOI":"10.1109\/SFCS.1985.49"},{"key":"10.1016\/S0304-3975(00)00145-6_BIB13","doi-asserted-by":"crossref","unstructured":"Z.-L. Zhang, D.A. Mix Barrington, J. Tarui, Computing symmetric functions with AND\/OR circuits and a single MAJORITY gate, Proc. 10th Ann. Symp. Theoretical Aspects of Computing, 1993, pp. 535\u2013544.","DOI":"10.1007\/3-540-56503-5_53"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001456?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001456?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:20Z","timestamp":1556792480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001456"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00145-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}