Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.

First Page		Document Content
Date: 2014-04-12 03:40:34 Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science		Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11. Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 88,27 KB Share Document on Facebook

	Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB) DocID: 1vn3Y - View Document
	The communication complexity of addition Emanuele Viola∗ December 12, 2013 Abstract Suppose each of k ≤ no(1) DocID: 1uYzp - View Document
	Communication Complexity for Distributed Graphs Qin Zhang Indiana University Bloomington DocID: 1uTYi - View Document
	The multiparty communication complexity of interleaved group products W. T. Gowers∗ Emanuele Viola† DocID: 1uPys - View Document
	1 Fundamental limits on complexity and power consumption in coded communication Pulkit Grover† , Andrea Goldsmith† , Anant Sahai‡ † Stanford University ‡ University of California, Berkeley DocID: 1uKNv - View Document