{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:41Z","timestamp":1725663641552},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:29Z","timestamp":1330254989000},"page":"545-554","source":"Crossref","is-referenced-by-count":1,"title":["Threshold circuits for iterated multiplication: Using AC0 for free"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Maciel","sequence":"first","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.M.: Quasipolynomial size circuit classes. In Proc. of the 7th Ann. Conf. on Structure in Complexity Theory, 1992, 86\u201393","DOI":"10.1109\/SCT.1992.215383"},{"issue":"4","key":"54_CR2","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"P. W. Beame","year":"1986","unstructured":"Beame, P.W., Cook, S.A., Hoover, H.J.: Log depth circuits for division and related problems. SIAM J. on Computing 15:4 (1986) 994\u20131003","journal-title":"SIAM J. on Computing"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Beigel, R., Reingold, N., Spielman, D.: The Perceptron strikes back. In Proc. of the 6th Ann. Conf. on Structure in Complexity Theory, 1991, 286\u2013291","DOI":"10.1109\/SCT.1991.160270"},{"key":"54_CR4","unstructured":"Beigel, R., Tarui, J.: On ACC. In Proc. of the 32th Ann. IEEE Symp. on Foundations of Computer Sc., 1991, 783\u2013792"},{"issue":"2","key":"54_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A. K. Chandra","year":"1984","unstructured":"Chandra, A.K., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. on Computing 13:2 (1984) 423\u2013439","journal-title":"SIAM J. on Computing"},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","volume":"36","author":"R. Fagin","year":"1985","unstructured":"Fagin, R., Klawe, M., Pippenger, N.J., Stockmeyer, L.: Bounded-depth polynomial-size circuits for symmetric functions. Theoretical Computer Sc. 36 (1985) 239\u2013250","journal-title":"Theoretical Computer Sc."},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Goldmann, M., H\u00e5stad, J., Razborov, A.: Majority gates vs. general weighted threshold gates. In Proc. of the 7th Ann. Conference on Structure in Complexity Theory, 1992, 2\u201313. To appear in Computational Complexity.","DOI":"10.1007\/BF01200426"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Goldmann, M., Karpinski, M.: Simulating threshold circuits by majority circuits. Manuscript, 1992.","DOI":"10.1145\/167088.167234"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Hajnal, A., Maass, W., Pudl\u00e1k, P., Szegedy, M., Tur\u00e1n, G.: Threshold circuits of bounded depth. In Proc. of the 28th Ann. IEEE Symp. on Foundations of Computer Sc., 1987, 99\u2013110","DOI":"10.1109\/SFCS.1987.59"},{"key":"54_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(91)90183-I","volume":"39","author":"T. Hofmeister","year":"1991","unstructured":"Hofmeister, T., Hohberg, W., K\u00f6hling, S.: Some notes on threshold circuits, and multiplication in depth 4. Information Processing Letters 39 (1991) 219\u2013225","journal-title":"Information Processing Letters"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Immerman, N., Landau, S.: The complexity of iterated multiplication. In Proc. of the 4th Ann. Conference on Structure in Complexity Theory, 1989, 104\u2013111","DOI":"10.1109\/SCT.1989.41816"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd ed., (Grad. Texts in Math., 84) Springer-Verlag, 1990","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"54_CR13","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, (Enc. of Math. and its App., 20) Addison-Wesley, 1983"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: On threshold circuits and polynomial computation. In Proc. of the 2nd Ann. Conference on Structure in Complexity Theory, 1987, 118\u2013123","DOI":"10.1109\/PSCT.1987.10319260"},{"key":"54_CR15","unstructured":"Siu, K.-Y., Roychowdhury, V.: On optimal depth threshold circuits for multiplication and related problems. Manuscript, 1992. To appear in SIAM J. on Discrete Math."},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Tarui, J.: Randomized polynomials, threshold circuits, and the polynomial hierarchy. In Proc. of the 8th Ann. Symp. on Theoretical Aspects of Computer Sc., (LNCS, 480) Springer-Verlag, 1991, 238\u2013250. To appear in Theoretical Computer Sc. under the title: Probabilistic polynomials, ACo functions, and the polynomial-time hierarchy.","DOI":"10.1007\/BFb0020802"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Separating the polynomial-time hierarchy by oracles. In Proc. of the 26th Ann. IEEE Symp. on Foundations of Computer Sc., 1985, 1\u201310","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T14:50:59Z","timestamp":1713624659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}