{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:31Z","timestamp":1725456751473},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029613","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"232-238","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of symmetric functions in parity normal forms"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Damm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: \u2211 1 1 -formulae on finite structures, Ann. Pure and Applied Logics 24(1983), 1\u201348","journal-title":"Ann. Pure and Applied Logics"},{"key":"22_CR2","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., Wegener, I.: The complexity of symmetric functions in bounded depth circuits, Information Processing Letters 25(1987), 217\u2013219","journal-title":"Information Processing Letters"},{"key":"22_CR3","unstructured":"Diskrete Mathematik und mathematische Fragen der Kybernetik, ed. Burosch, G., Kiesewetter, H., Berlin 1980, 274\u2013277"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Damm,C.,Meinel,Ch.:Separating completely complexity classes related to polynomial size \u03a9-decision trees, Proc. FCT'89(Szeged), LNCS 380, 127\u2013136","DOI":"10.1007\/3-540-51498-8_12"},{"key":"22_CR5","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.,Shelah, S.:Definability by constant-depth polynomial-size circuits, Information and control 70(1986), 216\u2013240","journal-title":"Information and control"},{"key":"22_CR6","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.,Pippenger, N.,Stockmeyer, L.: Bounded depth, polynomial size circuits for symmetric functions, Theoretical Computer Science 36(1985), 239\u2013250","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Furst,M.,Saxe,J.,Sipser,M.:Parity, circuits and the polynomial time hierarchy, Proc. 22nd IEEE FOCS (1981), 260\u2013270","DOI":"10.1109\/SFCS.1981.35"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"H\u00e5stad,J.:Almost optimal lower bounds for small depth circuits. Proc. 18th ACM STOC (1986), 6\u201320","DOI":"10.1145\/12130.12132"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Razborov, A.:Lower bounds on the size of bounded depth circuits over the basis {\u039b,\u2295}, preprint Steklov Inst. for Math., Moscow 1986 (see also Mat. Zam. 41(1987), 598\u2013607)(in Russian)","DOI":"10.1070\/RM1986v041n04ABEH003385"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Separating the polynomial time hierarchy by oracles Proc. 26th IEEE FOCS (1985), 1\u201310","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:24Z","timestamp":1586592924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0029613","relation":{},"subject":[]}}