{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:09Z","timestamp":1725572169465},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_24","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"334-345","source":"Crossref","is-referenced-by-count":9,"title":["Some Meet-in-the-Middle Circuit Lower Bounds"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"M. Karchmer","year":"1990","unstructured":"Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require superlogarithmic depth. SIAM Journal on Discrete Mathematics\u00a03, 255\u2013265 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"24_CR2","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":"24_CR3","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                      www.cs.washington.edu\/homes\/beame"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/jcss.1997.1552","volume":"56","author":"C. Berg","year":"1998","unstructured":"Berg, C., Ulfberg, S.: A lower bound for perceptrons and an oracle sepration of the PPPH hierarchy. Journal of Computer and System Sciences\u00a056, 263\u2013271 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0020-0190(97)00141-5","volume":"63","author":"M. Goldmann","year":"1997","unstructured":"Goldmann, M.: On the power of a threshold gate at the top. Information Processing Letters\u00a063, 287\u2013293 (1997)","journal-title":"Information Processing Letters"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s000370050015","volume":"7","author":"M. Krause","year":"1998","unstructured":"Krause, M., Pudl\u00e1k, P.: Computing boolean functions by polynomials and threshold circuits. Computational Complexity\u00a07, 346\u2013370 (1998)","journal-title":"Computational Complexity"},{"key":"24_CR7","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":"24_CR8","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":"24_CR9","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\u03a9(log n) 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":"24_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A.A. Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural proofs. Journal of Computer and System Sciences\u00a055, 24\u201335 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR11","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 93","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)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/S0895480193255505","volume":"9","author":"S.C. Tsai","year":"1996","unstructured":"Tsai, S.C.: Lower bounds on representing Boolean functions as polynomials in Zm. SIAM Journal on Discrete Mathematics\u00a09, 55\u201362 (1996)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01215346","volume":"14","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Beigel, R., Furst, M., Rudich, S.: The expressive power of voting polynomials. Combinatorica\u00a014, 1\u201314 (1994)","journal-title":"Combinatorica"},{"key":"24_CR14","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, 314\u2013324 (1994)","journal-title":"Computational Complexity"},{"key":"24_CR15","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":"24_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01263424","volume":"4","author":"D.A.M. Barrington","year":"1994","unstructured":"Barrington, D.A.M., Beigel, R., Rudich, S.: Representing Boolean functions as polynomials modulo composite numbers. Computational Complexity\u00a04, 367\u2013382 (1994)","journal-title":"Computational Complexity"},{"key":"24_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, 16\u201338 (2000)","journal-title":"Computational Complexity"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/SCT.1991.160282","volume-title":"Proceedings of the Sixth Annual Structure in Complexity Theory Conference","author":"J. Tarui","year":"1991","unstructured":"Tarui, J.: Degree complexity of Boolean functions and its applications to relativized separations. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pp. 382\u2013390. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00061-9","volume":"207","author":"H. Vollmer","year":"1998","unstructured":"Vollmer, H.: Relating polynomial time to constant depth. Theoretical Computer Science\u00a0207, 159\u2013170 (1998)","journal-title":"Theoretical Computer Science"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/116825.116858","volume":"38","author":"J. Tor\u00e1n","year":"1991","unstructured":"Tor\u00e1n, J.: Complexity classes defined by counting quantifiers. Journal of the ACM\u00a038, 753\u2013774 (1991)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:55Z","timestamp":1620012475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}