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
Introduction to Coding Theory
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
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computational Complexity
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| 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 analogue 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/2k) multiparty communication complexity. We also exhibit constructions of Hadamard tensors, giving Ω(n/2k) lower bounds on multiparty communication complexity for a new class of explicitly defined Boolean functions.