{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:08Z","timestamp":1763468168326},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_46","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"516-527","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial Threshold Functions and Boolean Threshold Circuits"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir V.","family":"Podolskii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"46_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00037-008-0244-2","volume":"17","author":"S. Basu","year":"2008","unstructured":"Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.J.: Polynomials that sign represent parity and Descartes\u2019 rule of signs. Computat. Complex.\u00a017(3), 377\u2013406 (2008)","journal-title":"Computat. Complex."},{"key":"46_CR2","unstructured":"Beigel, R.: The polynomial method in circuit complexity. In: CCC 1993, pp. 82\u201395. IEEE Computer Society Press (1993)"},{"issue":"4","key":"46_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01263422","volume":"4","author":"R. Beigel","year":"1994","unstructured":"Beigel, R.: Perceptrons, PP, and the polynomial hierarchy. Comput. Complex.\u00a04(4), 339\u2013349 (1994)","journal-title":"Comput. Complex."},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0221003","volume":"21","author":"J. Bruck","year":"1992","unstructured":"Bruck, J., Smolensky, R.: Polynomial threshold functions, AC0 functions, and spectral norms. SIAM J. Comput.\u00a021(1), 33\u201342 (1992)","journal-title":"SIAM J. Comput."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Vereshchagin, N.K., de Wolf, R.: On computation and communication with small bias. In: CCC 2007, pp. 24\u201332 (2007)","DOI":"10.1109\/CCC.2007.18"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Butkovi\u010d, P.: Max-linear Systems: Theory and Algorithms. Springer (2010)","DOI":"10.1007\/978-1-84996-299-5"},{"issue":"4","key":"46_CR7","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(4), 612\u2013625 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR8","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)"},{"issue":"6","key":"46_CR9","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. Inform. Process. Lett.\u00a063(6), 287\u2013293 (1997)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"46_CR10","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. Comput. Complex.\u00a02(4), 277\u2013300 (1992)","journal-title":"Comput. Complex."},{"issue":"2","key":"46_CR11","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":"46_CR12","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":"46_CR13","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Podolskii, V.V.: Exact threshold circuits. In: CCC 2010, pp. 270\u2013279. IEEE Computer Society (2010)","DOI":"10.1109\/CCC.2010.33"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Podolskii, V.V.: Polynomial threshold functions and boolean threshold circuits. ECCC TR13-021 (2013)","DOI":"10.1007\/978-3-642-40313-2_46"},{"key":"46_CR15","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. Comput. Complex.\u00a01, 113\u2013129 (1991)","journal-title":"Comput. Complex."},{"issue":"4","key":"46_CR16","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.jcss.2003.11.002","volume":"68","author":"A.R. Klivans","year":"2004","unstructured":"Klivans, A.R., O\u2019Donnell, R., Servedio, R.A.: Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci.\u00a068(4), 808\u2013840 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"46_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jcss.2003.07.007","volume":"68","author":"A.R. Klivans","year":"2004","unstructured":"Klivans, A.R., Servedio, R.A.: Learning DNF in time $2^{{\\widetilde{O}}(n^{1\/3})}$ . J. Comput. Syst. Sci.\u00a068(2), 303\u2013318 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"46_CR18","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. Theor. Comput. Sci.\u00a0174(1\u20132), 137\u2013156 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"46_CR19","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. Complex.\u00a07(4), 346\u2013370 (1998)","journal-title":"Comput. Complex."},{"key":"46_CR20","unstructured":"Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. MIT Press (1969)"},{"key":"46_CR21","unstructured":"Muroga, S.: Threshold Logic and its Applications. John Wiley & Sons, Inc. (1971)"},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0016-0032(61)90702-5","volume":"271","author":"S. Muroga","year":"1961","unstructured":"Muroga, S., Toda, I., Takasu, S.: Theory of majority decision elements. Journal of the Franklin Institute\u00a0271, 376\u2013418 (1961)","journal-title":"Journal of the Franklin Institute"},{"key":"46_CR23","unstructured":"Nisan, N.: The communication complexity of threshold gates. In: Mikl\u00f3s, D., Sz\u00f6nyi, T., S\u00f3s, V.T. (ed.) Combinatorics, Paul Erd\u0151s is Eighty, Mathematical Studies, vol. 1, pp. 301\u2013315. Bolyai Society (1993)"},{"issue":"1","key":"46_CR24","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R. Paturi","year":"1986","unstructured":"Paturi, R., Simon, J.: Probabilistic communication complexity. J. Comput. Syst. Sci.\u00a033(1), 106\u2013123 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"46_CR25","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(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom. Inf. Proc. Lett.\u00a045(6), 303\u2013307 (1993)","journal-title":"Inf. Proc. Lett."},{"issue":"5","key":"46_CR26","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1137\/080744037","volume":"39","author":"A.A. Razborov","year":"2010","unstructured":"Razborov, A.A., Sherstov, A.A.: The sign-rank of AC0. SIAM J. Comput.\u00a039(5), 1833\u20131855 (2010)","journal-title":"SIAM J. Comput."},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Saks, M.E.: Slicing the hypercube. In: Walker, K. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0187. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511662089.009"},{"key":"46_CR28","first-page":"59","volume":"95","author":"A.A. Sherstov","year":"2008","unstructured":"Sherstov, A.A.: Communication lower bounds using dual polynomials. Bulletin of the EATCS\u00a095, 59\u201393 (2008)","journal-title":"Bulletin of the EATCS"},{"issue":"6","key":"46_CR29","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1137\/08071421X","volume":"38","author":"A.A. Sherstov","year":"2009","unstructured":"Sherstov, A.A.: Separating AC0 from depth-2 majority circuits. SIAM J. Comput.\u00a038(6), 2113\u20132129 (2009)","journal-title":"SIAM J. Comput."},{"key":"46_CR30","unstructured":"Speyer, D., Sturmfels, B.: Tropical Mathematics. ArXiv math\/0408099 (2004), http:\/\/arxiv.org\/abs\/math\/0408099"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T03:23:51Z","timestamp":1596338631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}