Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
SIAM Journal on Computing
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational Complexity - Special issue on circuit complexity
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Sperner theory
Boolean Circuits, Tensor Ranks, and Communication Complexity
SIAM Journal on Computing
Communication complexity
Some bounds on multiparty communication complexity of pointer jumping
Computational Complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
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
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight lower bounds for selection in randomly ordered streams
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Maximum Communication Complexity of Multi-Party Pointer Jumping
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Property Testing Lower Bounds via Communication Complexity
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
In this paper, we study the pointer jumping problem under the one-way number-on-the-forehead (NOF) multiparty communication model. This problem is widely considered to be a candidate for proving strong lower bounds under the NOF model, and has applications to proving lower bounds for many other problems.We investigate the maximum communication complexity of collapsing protocols for pointer jumping, where each player sees all layers behind her and only the composition of layers ahead of her. We present a collapsing protocol in which every player communicates at most $n-\frac{1}{2}\log_{2} n+1$ bits, which tightly matches the lower bound of $n-\frac{1}{2}\log_{2} n-2$ given by Brody and Chakrabarti (in Proc. 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 145---156, 2008). Actually, in our protocol only three players need to communicate information: the first player sends log2(n+1) bits, the second to last player sends $n-\frac{1}{2}\log_{2} n+1$ bits, and the last player just outputs the answer. A natural question is whether the log2(n+1) bits communicated by the first player is necessary for achieving a low maximum communication complexity. We make progress towards this question by proving that in any collapsing protocol for the 3-player pointer jumping problem, if the first player only sends one bit, then the second player must communicate at least n驴2 bits.