{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:55Z","timestamp":1725559795793},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_80","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"994-1005","source":"Crossref","is-referenced-by-count":6,"title":["Lower Bounds for Circuits with Few Modular and Symmetric Gates"],"prefix":"10.1007","author":[{"given":"Arkadev","family":"Chattopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_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, 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"80_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":"80_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":"80_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SFCS.1985.49","volume-title":"26th 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: 26th Annual Symposium on Foundations of Computer Science, pp. 1\u201310. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"80_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"A.A. Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds for the size of circuits of bounded depth with basis (\u2227, \u2295). Mathematical Notes of the Academy of Science of the USSR\u00a041, 333\u2013338 (1987)","journal-title":"Mathematical Notes of the Academy of Science of the USSR"},{"key":"80_CR6","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: 19th Annual ACM Symposium on Theory of Computing, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"80_CR7","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, 135\u2013148 (1994)","journal-title":"Combinatorica"},{"key":"80_CR8","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, 191\u2013202 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR9","first-page":"314","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, 314\u2013324 (1994)","journal-title":"Polylog(n) majority gates are equivalent to one. Computational Complexity"},{"key":"80_CR10","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, 325\u2013338 (1994)","journal-title":"Computational Complexity"},{"key":"80_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-28629-5_24","volume-title":"Mathematical Foundations of Computer Science 2004","author":"K.A. Hansen","year":"2004","unstructured":"Hansen, K.A., Miltersen, P.B.: Some meet-in-the-middle circuit lower bounds. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 334\u2013345. Springer, Heidelberg (2004)"},{"key":"80_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J. H\u00e5stad","year":"1991","unstructured":"H\u00e5stad, J., Goldmann, M.: On the power of small-depth threshold circuits. Computational Complexity\u00a01, 113\u2013129 (1991)","journal-title":"Computational Complexity"},{"key":"80_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(93)90041-7","volume":"45","author":"A. Razborov","year":"1993","unstructured":"Razborov, A., Wigderson, A.: n\n                           \u03a9(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom. Information Processing Letters\u00a045, 303\u2013307 (1993)","journal-title":"Information Processing Letters"},{"key":"80_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"Babai, L., Nisan, N., Szegedy, S.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. Journal of Computer and System Sciences\u00a045, 204\u2013232 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR15","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, 16\u201338 (2000)","journal-title":"Computational Complexity"},{"key":"80_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01294257","volume":"6","author":"R. Beigel","year":"1997","unstructured":"Beigel, R., Maciel, A.: Upper and lower bounds for some depth-3 circuit classes. Computational Complexity\u00a06, 235\u2013255 (1997)","journal-title":"Computational Complexity"},{"key":"80_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(96)00019-9","volume":"174","author":"M. Krause","year":"1997","unstructured":"Krause, M., Pudl\u00e1k, P.: On the computational power of depth-2 circuits with threshold and modulo gates. Theoretical Computer Science\u00a0174, 137\u2013156 (1997)","journal-title":"Theoretical Computer Science"},{"key":"80_CR18","volume-title":"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: 20th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos (2005) (to appear)"},{"key":"80_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. Journal of Computer and System Sciences\u00a049, 149\u2013167 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR20","first-page":"94","volume-title":"15th Annual ACM Symposium on Theory of Computing","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Furst, M.L., Lipton, L.: Multi-party protocols. In: 15th Annual ACM Symposium on Theory of Computing, pp. 94\u201399. ACM Press, New York (1983)"},{"key":"80_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/0406009","volume":"6","author":"F.R.K. Chung","year":"1993","unstructured":"Chung, F.R.K., Tetali, P.: Communication complexity and quasi randomness. SIAM Journal on Discrete Mathematics\u00a06, 110\u2013123 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"80_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A. Hajnal","year":"1993","unstructured":"Hajnal, A., Maass, W., Pudl\u00e1k, P., Szegedy, M., Tur\u00e1n, G.: Threshold circuits of bounded depth. Journal of Computer and System Sciences\u00a046, 129\u2013154 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR23","unstructured":"Beame, P.: A switching lemma primer. Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington (1994), Availible online, at \n                    \n                      http:\/\/www.cs.washington.edu\/homes\/beame"},{"key":"80_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00001597","volume":"7","author":"G. Tardos","year":"1998","unstructured":"Tardos, G., Barrington, D.A.M.: A lower bound on the mod 6 degree of the or function. Computational Complexity\u00a07, 99\u2013108 (1998)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:09Z","timestamp":1619506029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11523468_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}