Abstract
We continue the study of a recently introduced model of communication complexity with advice, focusing on the power of advice in the context of equality of bitstrings and divisibility of natural numbers. First, we establish that the equality problem admits a protocol of polylogarithmic communication, provided a laconic advice of just one bit. For the divisibility problem, we design a protocol with sublinear communication and advice of roughly \({\tilde{O}}(\sqrt{n})\). We complement our result on divisibility with a matching lower bound in a restricted setting using a recent result of Chattopadhyay et al. and a reduction from set-disjointness to divisibility.
This work was partially supported by SNF grant 200021-146372.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hromkovič, J.: Communication Complexity and Parallel Computing. Springer, New York (1997)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, New York (1997)
Patrascu, M.: Towards polynomial lower bounds for dynamic problems. In: Schulman, L.J. (ed.) STOC, pp. 603–610. ACM (2010)
Chattopadhyay, A., Edmonds, J., Ellen, F., Pitassi, T.: A little advice can be very helpful. In: Rabani, Y. (ed.) SODA, pp. 615–625. SIAM (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barhum, K., Hromkovič, J. (2016). On the Power of Laconic Advice in Communication Complexity. In: Freivalds, R., Engels, G., Catania, B. (eds) SOFSEM 2016: Theory and Practice of Computer Science. SOFSEM 2016. Lecture Notes in Computer Science(), vol 9587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49192-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-49192-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49191-1
Online ISBN: 978-3-662-49192-8
eBook Packages: Computer ScienceComputer Science (R0)