{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:26Z","timestamp":1725456746471},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029651","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"523-529","source":"Crossref","is-referenced-by-count":0,"title":["Symmetric functions in AC 0 can be computed in constant depth with very small size"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Wurm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Zin","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","first-page":"471","volume":"16","author":"M. Ajtai","year":"1984","unstructured":"Ajtai, M. and Ben-Or, M. (1984). A theorem on probabilistic constant depth computations. 16. Symp. on Theory of Computing, 471\u2013474.","journal-title":"Symp. on Theory of Computing"},{"key":"60_CR2","first-page":"475","volume":"16","author":"R. Boppana","year":"1984","unstructured":"Boppana, R. (1984). Threshold functions and bounded depth monotone circuits. 16. Symp. on Theory of Computing, 475\u2013479.","journal-title":"Symp. on Theory of Computing"},{"key":"60_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(87)90163-3","volume":"25","author":"B. Brustmann","year":"1987","unstructured":"Brustmann, B. and Wegener, I. (1987). The complexity of symmetric functions in bounded-depth circuits. Information Processing Letters 25, 217\u2013219.","journal-title":"Information Processing Letters"},{"key":"60_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0019-9958(86)80006-7","volume":"70","author":"L. Denenberg","year":"1986","unstructured":"Denenberg, L., Gurevich, Y. and Shelah, S. (1986). Definability by constant-depth polynomial-size circuits. Information and Control 70, 216\u2013240.","journal-title":"Information and Control"},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","volume":"36","author":"R. Fagin","year":"1985","unstructured":"Fagin, R., Klawe, M.M., Pippenger, N.J. and Stockmeyer, L. (1985). Bounded-depth, polynomial-size circuits for symmetric functions. Theoretical Computer Science 36, 239\u2013250.","journal-title":"Theoretical Computer Science"},{"key":"60_CR6","first-page":"506","volume":"25","author":"J. Friedman","year":"1984","unstructured":"Friedman, J. (1984). Constructing O(n log n) size monotone formulae for the k-th elementary symmetric polynomial of n Boolean variables. 25. Symp. on Foundations of Computer Science, 506\u2013515.","journal-title":"Symp. on Foundations of Computer Science"},{"key":"60_CR7","first-page":"6","volume":"18","author":"J. Hastad","year":"1986","unstructured":"Hastad, J. (1986). Almost optimal lower bounds for small depth circuits. 18. Symp. on Theory of Computing, 6\u201320.","journal-title":"Symp. on Theory of Computing"},{"key":"60_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0020-0190(87)90216-X","volume":"25","author":"S. Moran","year":"1987","unstructured":"Moran, S. (1987). Generalized lower bounds derived from Hastad's main lemma. Information Processing Letters 25, 383\u2013388.","journal-title":"Information Processing Letters"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Newman,I., Ragde,P. and Wigderson,A. (1990). Perfect hashing, graph entropy an circuit complexity. Proc. Structure in Complexity Theory.","DOI":"10.1109\/SCT.1990.113958"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029651.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:54Z","timestamp":1607551194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0029651","relation":{},"subject":[]}}