Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Rounds in communication complexity revisited
SIAM Journal on Computing
Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
The BNS lower bound for multi-party protocols is nearly optimal
Information and Computation
Boolean Circuits, Tensor Ranks, and Communication Complexity
SIAM Journal on Computing
Communication complexity
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Unexpected Upper Bounds on the Complexity of Some Communication Games
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Non-uniform ACC Circuit Lower Bounds
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
| Hi-index | 0.00 |
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the "Number on the Forehead" model of Chandra, Furst, and Lipton. We define an analog of the Hadamard property of matrices for tensors in multiple dimensions and show that any k-party communication problem represented by a Hadamard tensor must have 驴(n/2 k ) multiparty communication complexity. We also exhibit constructions of Hadamard tensors. This allows us to obtain 驴(n/2 k ) lower bounds on multiparty communication complexity for a new class of explicitly defined Boolean functions.