LIPIcs.ISAAC.2018.10.pdf
- Filesize: 436 kB
- 12 pages
Document
Half-Duplex Communication Complexity
Authors
-
Part of:
Volume:
29th International Symposium on Algorithms and Computation (ISAAC 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Algorithms and Computation (ISAAC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-12-06
Cite AsGet BibTex
Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, and Alexander V. Smal. Half-Duplex Communication Complexity. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 10:1-10:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ISAAC.2018.10
https://doi.org/10.4230/LIPIcs.ISAAC.2018.10
Abstract
Suppose Alice and Bob are communicating in order to compute some function f, but instead of a classical communication channel they have a pair of walkie-talkie devices. They can use some classical communication protocol for f where in each round one player sends a bit and the other one receives it. The question is whether talking via walkie-talkie gives them more power? Using walkie-talkies instead of a classical communication channel allows players two extra possibilities: to speak simultaneously (but in this case they do not hear each other) and to listen at the same time (but in this case they do not transfer any bits). The motivation for this kind of a communication model comes from the study of the KRW conjecture. We show that for some definitions this non-classical communication model is, in fact, more powerful than the classical one as it allows to compute some functions in a smaller number of rounds. We also prove lower bounds for these models using both combinatorial and information theoretic methods.
Subject Classification
ACM Subject Classification
- Theory of computation → Communication complexity
Keywords
- communication complexity
- half-duplex channel
- information theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Thomas M. Cover and Joy A. Thomas. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, New York, USA, 2006.
- Jeff Edmonds, Russell Impagliazzo, Steven Rudich, and Jirí Sgall. Communication complexity towards lower bounds on circuit depth. Computational Complexity, 10(3):210-246, 2001. URL: http://dx.doi.org/10.1007/s00037-001-8195-x.
- Klim Efremenko, Gillat Kol, and Raghuvansh Saxena. Interactive Coding Over the Noisy Broadcast Channel. Electronic Colloquium on Computational Complexity (ECCC), 24:93, 2017. URL: https://eccc.weizmann.ac.il/report/2017/093.
- Dmitry Gavinsky, Or Meir, Omri Weinstein, and Avi Wigderson. Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM J. Comput., 46(1):114-131, 2017. URL: http://dx.doi.org/10.1137/15M1018319.
- Johan Håstad and Avi Wigderson. Composition of the Universal Relation. In Jin-Yi Cai, editor, Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 119-134. DIMACS/AMS, 1990. URL: http://dimacs.rutgers.edu/Volumes/Vol13.html.
- Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, and Alexander Smal. Half-duplex communication complexity. Electronic Colloquium on Computational Complexity (ECCC), 25:89, 2018. URL: https://eccc.weizmann.ac.il/report/2018/089.
- Mauricio Karchmer, Ran Raz, and Avi Wigderson. Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Computational Complexity, 5(3/4):191-204, 1995. URL: http://dx.doi.org/10.1007/BF01206317.
- Mauricio Karchmer and Avi Wigderson. Monotone Circuits for Connectivity Require Super-logarithmic Depth. In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 539-550. ACM, 1988. URL: http://dx.doi.org/10.1145/62212.62265.
-
V. M. Khrapchenko. A method of obtaining lower bounds for the complexity of π-schemes. Mathematical Notes Academy of Sciences USSR, 10:474-479, 1972.
-
Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997.
- Andrew Chi-Chih Yao. Some Complexity Questions Related to Distributive Computing(Preliminary Report). In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pages 209-213, New York, NY, USA, 1979. ACM. URL: http://dx.doi.org/10.1145/800135.804414.