{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:09Z","timestamp":1742598609530,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:00:27Z","timestamp":1330275627000},"page":"83-94","source":"Crossref","is-referenced-by-count":1,"title":["On realizing iterated multiplication by small depth threshold circuits"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Krause","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E.: A note on the power of threshold circuits, Proceedings der 30. IEEE Symposium FOCS, 1989, 580\u2013584.","DOI":"10.1109\/SFCS.1989.63538"},{"key":"8_CR2","unstructured":"Alon, N., J. Bruck: Explicit constructions of depth-2 majority circuits for comparison and addition, Technical Report RJ 8300 (75661) of the IBM Almaden Research Center, San Jose, 1991."},{"issue":"Nr.22","key":"8_CR3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J. Bruck","year":"1990","unstructured":"Bruck, J. Harmonic analysis of polynomial threshold functions, SIAM Journal of Discrete Mathematics, 3, Nr. 22, 1990, 168\u2013177.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"8_CR4","unstructured":"Bertram, C., Hofmeister, Th., Krause, M., Multiple product mod small numbers manuscript Dortmund 1994"},{"key":"8_CR5","unstructured":"Bruck, J., Th. Hofmeister, Th. Kailath, K.Y. Siu, Depth efficient networks for division and related problems. Technical Report 1992, to appear in IEEE Transactions on Information Theory."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M. Goldmann","year":"1992","unstructured":"Goldmann, M., J. H\u00e5stad, A. A. Razborov: Majority Gates versus general weighted threshold gates, J. of Computational Complexity 2 (1992), 277\u2013300.","journal-title":"J. of Computational Complexity"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Goldmann, M., M. Karpinski: Simulating Threshold Circuits by Majority Circuits. Proc. 25th ACM Conference STOC, 1993.","DOI":"10.1145\/167088.167234"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Hajnal, A., W. Maass, P. Pudl\u00e1k, M. Szegedy, G. Tur\u00e1n: Threshold circuits of bounded depth, Proc. 28th IEEE Conf. FOCS, 1987, 99\u2013110.","DOI":"10.1109\/SFCS.1987.59"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Halstenberg, B., R. Reischuk Relations between communication complexity classes Proc. of the 3. IEEE Structure in Complexity Theory Conference, 1988, 19\u201328.","DOI":"10.1109\/SCT.1988.5259"},{"key":"8_CR10","unstructured":"Hofmeister, Th. Depth-efficient threshold circuits for arithmetic functions in: Theoretical Advances in Neural Computation and Learning eds. Roychowdhury et. al, Kluwer Academic Publishers, ISBN 0-7923-9478-X."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(91)90183-I","volume":"39","author":"T. Hofmeister","year":"1991","unstructured":"Hofmeister, Th., W. Hohberg, S. K\u00f6hling: Some notes on threshold circuits and multiplication in depth 4 IPL 39 (1991) 219\u2013225.","journal-title":"IPL"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Krause, M. Geometric Arguments yield better bounds for threshold circuits and distributed computing Proc. of the 6. IEEE Structure in Complexity Theory Conference, 314\u2013322.","DOI":"10.1109\/SCT.1991.160275"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Krause, M., S. Waack, Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fanin, Proc. 32th IEEE Conference FOCS, 1991, 777\u2013787.","DOI":"10.1109\/SFCS.1991.185448"},{"issue":"Nr.5","key":"8_CR14","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1137\/0221053","volume":"21","author":"J. H. Reif","year":"1992","unstructured":"Reif, J. H., S. R. Tate On threshold circuits and polynomial computation SIAM Journal of Computing, Vol. 21, Nr.5, pp. 896\u2013908, 1992","journal-title":"SIAM Journal of Computing"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: On ACC and Threshold Circuits, Proc. 31th IEEE Conference FOCS, 1990, 619\u2013628.","DOI":"10.1109\/FSCS.1990.89583"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:42:02Z","timestamp":1742596922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}