{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:51Z","timestamp":1759063731203},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T00:00:00Z","timestamp":1413936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s00493-014-3078-3","type":"journal-article","created":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T03:59:57Z","timestamp":1413950397000},"page":"703-747","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["The communication complexity of addition"],"prefix":"10.1007","volume":"35","author":[{"given":"Emanuele","family":"Viola","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,22]]},"reference":[{"key":"3078_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01215346","volume":"14","author":"J. Aspnes","year":"1994","unstructured":"J. Aspnes, R. Beigel, M. Furst and S. Rudich: The expressive power of voting polynomials, Combinatorica 14 (1994), 135\u2013148.","journal-title":"Combinatorica"},{"key":"3078_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. H\u00e5stad and R. Peralta: Simple constructions of almost k-wise independent random variables, Random Structures & Algorithms 3 (1992), 289\u2013304.","journal-title":"Random Structures & Algorithms"},{"key":"3078_CR3","volume-title":"A switching lemma primer, Technical Report UW-CSE-95-07-01","author":"P. Beame","year":"1994","unstructured":"P. Beame: A switching lemma primer, Technical Report UW-CSE-95-07-01, Depart-ment of Computer Science and Engineering, University of Washington, November 1994, Available from http:\/\/www.cs.washington.edu\/homes\/beame\/."},{"key":"3078_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF01263420","volume":"4","author":"R. Beigel","year":"1994","unstructured":"R. Beigel: When do extra majority gates help? polylog(-N) majority gates are equivalent to one, Comput. Complexity 4 (1994), 314\u2013324.","journal-title":"Comput. Complexity"},{"key":"3078_CR5","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"L. Babai, N. Nisan and M. Szegedy: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs, J. of Computer and System Sciences 45 (1992), 204\u2013232.","journal-title":"J. of Computer and System Sciences"},{"key":"3078_CR6","first-page":"221","volume-title":"IEEE Symp. on Foundations of Computer Science (FOCS)","author":"M. Ben-Or","year":"2008","unstructured":"M. Ben-Or and A. Hassidim: The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well), in: IEEE Symp. on Foundations of Computer Science (FOCS), 221\u2013230, 2008."},{"key":"3078_CR7","first-page":"757","volume-title":"Handbook of theoretical computer science","author":"R. Boppana","year":"1990","unstructured":"R. Boppana and M. Sipser: The complexity of finite functions, in: Handbook of theoretical computer science, Vol. A, 757\u2013804. Elsevier, Amsterdam, 1990."},{"key":"3078_CR8","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1137\/070712109","volume":"39","author":"A. Bogdanov","year":"2010","unstructured":"A. Bogdanov and E. Viola: Pseudorandom bits for polynomials, SIAM J. on Computing 39 (2010), 2464\u20132486.","journal-title":"SIAM J. on Computing"},{"key":"3078_CR9","volume-title":"New Mathematical Monographs","author":"A. Baker","year":"2007","unstructured":"A. Baker and G. W\u00fcstholz: Logarithmic forms and Diophantine geometry, volume 9 of New Mathematical Monographs, Cambridge University Press, 2007."},{"key":"3078_CR10","first-page":"459","volume-title":"Workshop on Randomization and Computation (RANDOM)","author":"M. Braverman","year":"2012","unstructured":"M. Braverman and O. Weinstein: A discrepancy lower bound for information complexity, in: Workshop on Randomization and Computation (RANDOM), 459\u2013470, 2012."},{"key":"3078_CR11","first-page":"94","volume-title":"15th ACM Symp. on the Theory of Computing (STOC)","author":"A. K. Chandra","year":"1983","unstructured":"A. K. Chandra, M. L. Furst and R. J. Lipton: Multi-party protocols, in: 15th ACM Symp. on the Theory of Computing (STOC), 94\u201399, 1983."},{"key":"3078_CR12","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1982","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner: Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, Inc., 1982."},{"key":"3078_CR13","first-page":"24","volume-title":"Int. Congress for Logic, Methodology and Philosophy of Science","author":"A. Cobham","year":"1964","unstructured":"A. Cobham: The intrinsic computational diffculty of functions, in: Int. Congress for Logic, Methodology and Philosophy of Science, 24\u201330, 1964."},{"key":"3078_CR14","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1137\/0406009","volume":"6","author":"F. R. K. Chung","year":"1993","unstructured":"F. R. K. Chung and P. Tetali: Communication complexity and quasi randomness, SIAM J. Discrete Math. 6 (1993), 110\u2013123.","journal-title":"SIAM J. Discrete Math."},{"key":"3078_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M. Dietzfelbinger","year":"1997","unstructured":"M. Dietzfelbinger, T. Hagerup, J. Katajainen and M. Penttonen: A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25 (1997), 19\u201351.","journal-title":"J. Algorithms"},{"key":"3078_CR16","volume-title":"ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"C. Dutta","year":"2013","unstructured":"C. Dutta, G. Pandurangan, R. Rajaraman, Z. Sun and E. Viola: On the complexity of information spreading in dynamic networks, in: ACM-SIAM Symp. on Discrete Algorithms (SODA), 2013."},{"key":"3078_CR17","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U. Feige","year":"1994","unstructured":"U. Feige, P. Raghavan, D. Peleg and E. Upfal: Computing with noisy information, SIAM J. Comput. 23 (1994), 1001\u20131018.","journal-title":"SIAM J. Comput."},{"key":"3078_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. L. Furst","year":"1984","unstructured":"M. L. Furst, J. B. Saxe and M. Sipser: Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory 17 (1984), 13\u201327.","journal-title":"Mathematical Systems Theory"},{"key":"3078_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022905618164","volume":"51","author":"J. Forster","year":"2003","unstructured":"J. Forster, N. Schmitt, H.-U. Simon and T. Suttorp: Estimating the optimal margins of embeddings in euclidean half spaces, Machine Learning 51 (2003), 263\u2013281.","journal-title":"Machine Learning"},{"key":"3078_CR20","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali: How to construct random functions, J. of the ACM 33 (1986), 792\u2013807.","journal-title":"J. of the ACM"},{"key":"3078_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M. Goldmann","year":"1992","unstructured":"M. Goldmann, J. H\u00e5stad and A. A. Razborov: Majority gates vs. general weighted threshold gates, Computational Complexity 2 (1992), 277\u2013300.","journal-title":"Computational Complexity"},{"key":"3078_CR22","first-page":"588","volume-title":"Workshop on Randomization and Computation (RANDOM)","author":"P. Gopalan","year":"2010","unstructured":"P. Gopalan and R. A. Servedio: Learning and lower bounds for AC0 with threshold gates, in: Workshop on Randomization and Computation (RANDOM), 588\u2013601, 2010."},{"key":"3078_CR23","volume-title":"Computational limitations of small-depth circuits","author":"J. H\u00e5stad","year":"1987","unstructured":"J. H\u00e5stad: Computational limitations of small-depth circuits, MIT Press, 1987."},{"key":"3078_CR24","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J. H\u00e5stad","year":"1994","unstructured":"J. H\u00e5stad: On the size of weights for threshold gates, SIAM J. Discrete Math. 7 (1994), 484\u2013492.","journal-title":"SIAM J. Discrete Math."},{"key":"3078_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J. H\u00e5stad","year":"1991","unstructured":"J. H\u00e5stad and M. Goldmann: On the power of small-depth threshold circuits, Comput. Complexity 1 (1991), 113\u2013129.","journal-title":"Comput. Complexity"},{"key":"3078_CR26","first-page":"419","volume-title":"Symp. on Theoretical Aspects of Computer Science (STACS)","author":"M. Krause","year":"2001","unstructured":"M. Krause and S. Lucks: On the minimal hardware complexity of pseudorandom function generators, in: Symp. on Theoretical Aspects of Computer Science (STACS), 419\u2013430, 2001."},{"key":"3078_CR27","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz and N. Nisan: Communication complexity, Cambridge University Press, 1997."},{"key":"3078_CR28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L. A. Levin","year":"1987","unstructured":"L. A. Levin: One way functions and pseudorandom generators, Combinatorica 7 (1987), 357\u2013363.","journal-title":"Combinatorica"},{"key":"3078_CR29","first-page":"607","volume":"40","author":"N. Linial","year":"1993","unstructured":"N. Linial, Y. Mansour and N. Nisan: Constant depth circuits, Fourier transform, and learnability, J. of the ACM 40 (1993), 607\u2013620.","journal-title":"Fourier transform, and learnability, J. of the ACM"},{"key":"3078_CR30","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1017\/S0963548308009656","volume":"18","author":"N. Linial","year":"2009","unstructured":"N. Linial and A. Shraibman: Learning complexity vs communication complexity, Combinatorics, Probability & Computing 18 (2009), 227\u2013245.","journal-title":"Combinatorics, Probability & Computing"},{"key":"3078_CR31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"P. Bro Miltersen","year":"1998","unstructured":"P. Bro Miltersen, N. Nisan, S. Safra and A. Wigderson: On data structures and asymmetric communication complexity, J. of Computer and System Sciences, 57 (1998), 37\u201349.","journal-title":"J. of Computer and System Sciences"},{"key":"3078_CR32","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0016-0032(61)90702-5","volume":"271","author":"S. Muroga","year":"1961","unstructured":"S. Muroga, I. Toda and S. Takasu: Theory of majority decision elements, J. Franklin Inst. 271 (1961), 376\u2013418.","journal-title":"J. Franklin Inst."},{"key":"3078_CR33","volume-title":"Threshold logic and its applications","author":"S. Muroga","year":"1971","unstructured":"S. Muroga: Threshold logic and its applications, Wiley-Interscience, New York, 1971."},{"key":"3078_CR34","first-page":"1462","volume":"11","author":"V. A. Nepomnja\u0161\u010di\u012d","year":"1970","unstructured":"V. A. Nepomnja\u0161\u010di\u012d: Rudimentary predicates and Turing calculations, Soviet Mathematics-Doklady 11 (1970), 1462\u20131465.","journal-title":"Soviet Mathematics-Doklady"},{"key":"3078_CR35","first-page":"301","volume-title":"Combinatorics, Paul Erd\u0151s is Eighty, number 1 in Bolyai Society Mathematical Studies","author":"N. Nisan","year":"1993","unstructured":"N. Nisan: The communication complexity of threshold gates, in: Combinatorics, Paul Erd\u0151s is Eighty, number 1 in Bolyai Society Mathematical Studies, 301\u2013315, 1993."},{"key":"3078_CR36","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"J. Naor and M. Naor: Small-bias probability spaces: effcient constructions and applications, SIAM J. on Computing 22 (1993), 838\u2013856.","journal-title":"SIAM J. on Computing"},{"key":"3078_CR37","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"M. Naor and O. Reingold: Synthesizers and their application to the parallel construction of pseudo-random functions, J. Comput. Syst. Sci. 58 (1999), 336\u2013375.","journal-title":"J. Comput. Syst. Sci."},{"key":"3078_CR38","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"M. Naor and O. Reingold: Number-theoretic constructions of efficient pseudorandom functions, J. of the ACM 51 (2004), 231\u2013262.","journal-title":"J. of the ACM"},{"key":"3078_CR39","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1137\/S0097539701389257","volume":"31","author":"M. Naor","year":"2002","unstructured":"M. Naor, O. Reingold and A. Rosen: Pseudorandom functions and factoring, SIAM J. Comput. 31 (2002), 1383\u20131404.","journal-title":"SIAM J. Comput."},{"key":"3078_CR40","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"N. Nisan and D. Zuckerman: Randomness is linear in space, J. of Computer and System Sciences 52 (1996), 43\u201352.","journal-title":"J. of Computer and System Sciences"},{"key":"3078_CR41","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1134\/S0032946009010062","volume":"45","author":"V. Podol\u2019ski\u012d","year":"2009","unstructured":"V. Podol\u2019ski\u012d: Perceptrons of large weight, Problems of Information Transmission 45 (2009), 46\u201353.","journal-title":"Problems of Information Transmission"},{"key":"3078_CR42","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/PL00001602","volume":"9","author":"R. Raz","year":"2000","unstructured":"R. Raz: The BNS-Chung criterion for multi-party communication complexity, Comput. Complexity 9 (2000), 113\u2013122.","journal-title":"Comput. Complexity"},{"key":"3078_CR43","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A. Razborov","year":"1997","unstructured":"A. Razborov and S. Rudich: Natural proofs, J. of Computer and System Sciences 55 (1997), 24\u201335.","journal-title":"J. of Computer and System Sciences"},{"key":"3078_CR44","volume-title":"Shannon\u2019s information methods for lower bounds for probabilistic communication complexity","author":"D. V. Smirnov","year":"1988","unstructured":"D. V. Smirnov: Shannon\u2019s information methods for lower bounds for probabilistic communication complexity, Master\u2019s thesis, Moscow University, 1988."},{"key":"3078_CR45","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00224-004-1210-2","volume":"39","author":"H. Straubing","year":"2006","unstructured":"H. Straubing and D. Th\u00e9erien: A note on modp \u2014 modm circuits, Theory Comput. Syst. 39 (2006), 699\u2013706.","journal-title":"Theory Comput. Syst."},{"key":"3078_CR46","doi-asserted-by":"crossref","first-page":"3122","DOI":"10.1137\/080735096","volume":"39","author":"R. Shaltiel","year":"2010","unstructured":"R. Shaltiel and E. Viola: Hardness amplification proofs require majority, SIAM J. on Computing 39 (2010), 3122\u20133154.","journal-title":"SIAM J. on Computing"},{"key":"3078_CR47","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1137\/050640941","volume":"36","author":"E. Viola","year":"2007","unstructured":"E. Viola: Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates, SIAM J. on Computing 36 (2007), 1387\u20131403.","journal-title":"SIAM J. on Computing"},{"key":"3078_CR48","volume-title":"Cell-probe lower bounds for prefix sums","author":"E. Viola","year":"2009","unstructured":"E. Viola: Cell-probe lower bounds for prefix sums, 2009, arXiv:0906.1370v1."},{"key":"3078_CR49","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4086\/toc.2008.v004a007","volume":"4","author":"E. Viola","year":"2008","unstructured":"E. Viola and A. Wigderson: Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols, Theory of Computing 4 (2008), 137\u2013168.","journal-title":"Theory of Computing"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3078-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3078-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3078-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:51Z","timestamp":1559093571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3078-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,22]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["3078"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3078-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,22]]}}}