{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:43Z","timestamp":1725489163076},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_44","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"448-458","source":"Crossref","is-referenced-by-count":6,"title":["Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory\u00a017(1), 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: \n                  \n                    \n                  \n                  $\\Sigma^{1}_{1}$\n                -formulae on finite structures. Annals of Pure and Applied Logic\u00a024, 1\u201348 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"44_CR3","volume-title":"Computational limitations of small-depth circuits","author":"J. H\u00e5stad","year":"1987","unstructured":"H\u00e5stad, J.: Computational limitations of small-depth circuits. MIT Press, Cambridge (1987)"},{"key":"44_CR4","first-page":"1","volume-title":"Proceedings 26st Annual Symposium on Foundations of Computer Science","author":"A.C.C. Yao","year":"1985","unstructured":"Yao, A.C.C.: Separating the polynomial\u2013time hierarchy by oracles. In: Proceedings 26st Annual Symposium on Foundations of Computer Science, pp. 1\u201310. IEEE Computer Society Press, Los Alamitos (1985)"},{"issue":"2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01215346","volume":"14","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Beigel, R., Furst, M.L., Rudich, S.: The expressive power of voting polynomials. Combinatorica\u00a014(2), 135\u2013148 (1994)","journal-title":"Combinatorica"},{"issue":"2","key":"44_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcss.1995.1017","volume":"50","author":"R. Beigel","year":"1995","unstructured":"Beigel, R., Reingold, N., Spielman, D.A.: PP is closed under intersection. Journal of Computer and System Sciences\u00a050(2), 191\u2013202 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"44_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/BF01263420","volume":"4","author":"R. Beigel","year":"1994","unstructured":"Beigel, R.: When do extra majority gates help? Polylog(n) majority gates are equivalent to one. Computational Complexity\u00a04(4), 314\u2013324 (1994)","journal-title":"Computational Complexity"},{"issue":"4","key":"44_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01263421","volume":"4","author":"D.A.M. Barrington","year":"1994","unstructured":"Barrington, D.A.M., Straubing, H.: Complex polynomials and circuit lower bounds for modular counting. Computational Complexity\u00a04(4), 325\u2013338 (1994)","journal-title":"Computational Complexity"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1007\/11523468_80","volume-title":"Automata, Languages and Programming","author":"A. Chattopadhyay","year":"2005","unstructured":"Chattopadhyay, A., Hansen, K.A.: Lower bounds for circuits with few modular and symmetric gates. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 994\u20131005. Springer, Heidelberg (2005)"},{"key":"44_CR10","first-page":"198","volume-title":"Proceedings of the 20th Annual IEEE Conference on Computational Complexity","author":"E. Viola","year":"2005","unstructured":"Viola, E.: Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates. In: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pp. 198\u2013209. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"44_CR11","unstructured":"Hansen, K.A.: Lower bounds for circuits with few modular gates using exponential sums. Technical Report\u00a079, Electronic Colloquium on Computational Complexity (2006)"},{"issue":"2\u20133","key":"44_CR12","doi-asserted-by":"publisher","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., Stockmeyer, L.: Bounded-depth, polynomial-size circuits for symmetric functions. Theoretical Computer Science\u00a036(2\u20133), 239\u2013250 (1985)","journal-title":"Theoretical Computer Science"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-56503-5_53","volume-title":"STACS 1993","author":"Z.L. Zhang","year":"1993","unstructured":"Zhang, Z.L., Barrington, D.A.M., Tarui, J.: Computing symmetric functions with AND\/OR circuits and a single MAJORITY gate. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 535\u2013544. Springer, Heidelberg (1993)"},{"issue":"2","key":"44_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(00)00145-6","volume":"261","author":"C.J. Lu","year":"2001","unstructured":"Lu, C.J.: An exact characterization of symmetric functions in qAC\n                0[2]. Theoretical Computer Science\u00a0261(2), 297\u2013303 (2001)","journal-title":"Theoretical Computer Science"},{"key":"44_CR15","unstructured":"Nisan, N.: The communication complexity of threshold gates. In: Mikl\u00f3s, D., Sz\u00f6nyi, T., S., V.T. (eds.) Combinatorics, Paul Erd\u00f6s is Eighty. Bolyai Society. Mathematical Studies 1, vol.\u00a01, pp. 301\u2013315 (1993)"},{"key":"44_CR16","unstructured":"Beame, P.: A switching lemma primer. Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington (1994), available online at \n                  \n                    www.cs.washington.edu\/homes\/beame"},{"issue":"1","key":"44_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/PL00001599","volume":"9","author":"F. Green","year":"2000","unstructured":"Green, F.: A complex-number fourier technique for lower bounds on the mod-m degre. Computational Complexity\u00a09(1), 16\u201338 (2000)","journal-title":"Computational Complexity"},{"key":"44_CR18","volume-title":"Perceptrons - An Introduction to Computational Geometry","author":"M. Minsky","year":"1969","unstructured":"Minsky, M., Papert, S.: Perceptrons - An Introduction to Computational Geometry. MIT Press, Cambridge (1969)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:59Z","timestamp":1619518679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}