{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:28:13Z","timestamp":1771486093942,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287025","type":"print"},{"value":"9783540318675","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_11","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"107-118","source":"Crossref","is-referenced-by-count":16,"title":["On the Complexity of Depth-2 Circuits with Threshold Gates"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480191218496","volume":"7","author":"N. Alon","year":"1994","unstructured":"Alon, N., Bruck, J.: Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. SIAM J. Disc. Math.\u00a07(1), 1\u20138 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"11_CR2","unstructured":"Amano, K., Maruoka, A.: Better Simulation of Exponential Weights by Polynomial Weights, Technical Report ECCC TR04-090 (2004)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.J.: Polynomials that Sign Represent Parity and Descartes Rule of Signs. In: Proc. 19th CCC, pp. 223\u2013235 (2004)","DOI":"10.1109\/CCC.2004.1313846"},{"key":"11_CR4","unstructured":"Bohossian, V., Riedel, M.D., Bruck, J.: Trading Weight Size for Circuit Depth: An LT2 Circuit for Comparison, Tech. Report of PARADISE, ETR028 (1998), Available at http:\/\/www.paradise.caltech.edu\/~riedel\/research\/lt2comp.html"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3","volume":"65","author":"J. Forster","year":"2002","unstructured":"Forster, J.: A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. J. Comput. Syst. Sci.\u00a065, 612\u2013625 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-45294-X_15","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"J. Forster","year":"2001","unstructured":"Forster, J., Krause, M., Lokam, S.V., Mubarakzjanov, R., Schmitt, N., Simon, H.U.: Relations between communication complexity, linear arrangements, and computational complexity. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 171\u2013182. Springer, Heidelberg (2001)"},{"key":"11_CR7","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. Info. Proc. Let.\u00a063, 287\u2013293 (1997)","journal-title":"Info. Proc. Let."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M. Goldmann","year":"1992","unstructured":"Goldmann, M., H\u00e5stad, J., Razborov, A.A.: Majority Gates vs. General Weighted Threshold Gates. Computational Complexity\u00a02, 277\u2013300 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/S0097539794274519","volume":"27","author":"M. Goldmann","year":"1998","unstructured":"Goldmann, M., Karpinski, M.: Simulating Threshold Circuits by Majority Circuits. SIAM J. Comput.\u00a027(1), 230\u2013246 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR10","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. J. Comput. Syst. Sci.\u00a046(2), 129\u2013154 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-61332-3_146","volume-title":"Computing and Combinatorics","author":"T. Hofmeister","year":"1996","unstructured":"Hofmeister, T.: A Note on the Simulation of Exponential Threshold Weights. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 136\u2013141. Springer, Heidelberg (1996)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Krause, M., Pudl\u00e1k, P.: On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. In: Proc. 25th STOC, pp. 48\u201357 (1993)","DOI":"10.1145\/195058.195103"},{"issue":"4","key":"11_CR13","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. Comput. Complexity\u00a07(4), 346\u2013370 (1998)","journal-title":"Comput. Complexity"},{"key":"11_CR14","unstructured":"Krause, M., Wegener, I.: Circuit Complexity. In: Crama, Y., Hammer, P. (eds.) Boolean Functions, vol.\u00a0II (2004)"},{"key":"11_CR15","volume-title":"Perceptrons (Expanded Ed.)","author":"M. Minsky","year":"1988","unstructured":"Minsky, M., Papert, S.: Perceptrons (Expanded Ed.). MIT Press, Cambridge (1988)"},{"key":"11_CR16","volume-title":"Threshold Logic and its Applications","author":"S. Muroga","year":"1971","unstructured":"Muroga, S.: Threshold Logic and its Applications. John Wiley, New York (1971)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.: New Degree Bounds for Polynomial Threshold Functions. In: Proc. 35th STOC, pp. 325\u2013334 (2003)","DOI":"10.1145\/780542.780592"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.: Extremal Properties of Polynomial Threshold Functions. In: Proc. 18th CCC, pp. 3\u201312 (2003)","DOI":"10.1109\/CCC.2003.1214406"},{"key":"11_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I. Parberry","year":"1994","unstructured":"Parberry, I.: Circuit Complexity and Neural Networks. The MIT Press, London (1994)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-55706-7_4","volume-title":"Algorithm Theory - SWAT 1992","author":"A.A. Razborov","year":"1992","unstructured":"Razborov, A.A.: On Small Depth Threshold Circuits. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol.\u00a0621, pp. 42\u201352. Springer, Heidelberg (1992)"},{"key":"11_CR21","volume-title":"Slicing the Hypercube","author":"M. Saks","year":"1993","unstructured":"Saks, M.: Slicing the Hypercube. Cambridge University Press, Cambridge (1993)"},{"issue":"3","key":"11_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0404038","volume":"4","author":"K.I. Siu","year":"1991","unstructured":"Siu, K.I., Bruck, J.: On the Power of Threshold Circuits with Small Weights. SIAM J. Disc. Math.\u00a04(3), 423\u2013435 (1991)","journal-title":"SIAM J. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:08Z","timestamp":1605642068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11549345_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}