Abstract
We show that randomized communication complexity can be superlogarithmic in the partition number of the associated communication matrix, and we obtain near-optimal randomized lower bounds for the Clique versus Independent Set problem. These results strengthen the deterministic lower bounds obtained in prior work (Göös, Pitassi, and Watson, FOCS’15). One of our main technical contributions states that information complexity when the cost is measured with respect to only 1-inputs (or only 0-inputs) is essentially equivalent to information complexity with respect to all inputs.
- Scott Aaronson, Shalev Ben-David, and Robin Kothari. 2016. Separations in query complexity using cheat sheets. In Proceedings of the 48th Symposium on Theory of Computing (STOC’16). ACM, 863--876. Google Scholar
Digital Library
- Alfred Aho, Jeffrey Ullman, and Mihalis Yannakakis. 1983. On notions of information transfer in VLSI circuits. In Proceedings of the 15th Symposium on Theory of Computing (STOC’83). ACM, 133--139. Google Scholar
Digital Library
- Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, and Juris Smotrovs. 2016. Separations in query complexity based on pointer functions. In Proceedings of the 48th Symposium on Theory of Computing (STOC’16). ACM, 800--813. Google Scholar
Digital Library
- Andris Ambainis, Martins Kokainis, and Robin Kothari. 2016. Nearly optimal separations between communication (Or Query) complexity and partitions. In Proceedings of the 31st Computational Complexity Conference (CCC’16). 4:1--4:14. Google Scholar
Digital Library
- Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha. 2016. Separations in communication complexity using cheat sheets and information complexity. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS’16). IEEE, 555--564.Google Scholar
Cross Ref
- Sepehr Assadi. 2017. Tight space-approximation tradeoff for the multi-pass streaming set cover problem. In Proceedings of the 36th Symposium on Principles of Database Systems (PODS’17). ACM, 321--335. Google Scholar
Digital Library
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2004. An information statistics approach to data stream and communication complexity. J. Comput. System Sci. 68, 4 (2004), 702--732. Google Scholar
Digital Library
- Aleksandrs Belovs. 2006. Non-intersecting complexity. In Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’06). Springer, 158--165. Google Scholar
Digital Library
- Elmar Böhler, Christian Glaßer, and Daniel Meister. 2006. Error-bounded probabilistic computations between MA and AM. J. Comput. System Sci. 72, 6 (2006), 1043--1076. Google Scholar
Digital Library
- Mark Braverman. 2015. Interactive information complexity. SIAM J. Comput. 44, 6 (2015), 1698--1739.Google Scholar
Cross Ref
- Mark Braverman and Ankur Moitra. 2013. An information complexity approach to extended formulations. In Proceedings of the 45th Symposium on Theory of Computing (STOC’13). ACM, 161--170. Google Scholar
Digital Library
- Mark Braverman and Anup Rao. 2014. Information equals amortized communication. IEEE Trans. Inf. Theory 60, 10 (2014), 6058--6069.Google Scholar
Cross Ref
- Mark Braverman and Omri Weinstein. 2015. An interactive information odometer and applications. In Proceedings of the 47th Symposium on Theory of Computing (STOC)’15. ACM, 341--350. Google Scholar
Digital Library
- Mark Braverman and Omri Weinstein. 2015. Personal communication.Google Scholar
- Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf. 2015. Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62, 2 (2015), 17:1--17:23. Google Scholar
Digital Library
- Dmitry Gavinsky and Shachar Lovett. 2014. En route to the log-rank conjecture: New reductions and equivalent formulations. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14). Springer, 514--524.Google Scholar
Cross Ref
- Mika Göös. 2015. Lower bounds for clique vs. independent set. In Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS’15). IEEE, 1066--1076. Google Scholar
Digital Library
- Mika Göös, T. S. Jayram, Toniann Pitassi, and Thomas Watson. 2017. Randomized communication vs. partition number. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP’17). Schloss Dagstuhl, 52:1--52:15.Google Scholar
- Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. 2016. Rectangles are nonnegative juntas. SIAM J. Comput. 45, 5 (2016), 1835--1869.Google Scholar
Cross Ref
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2015. Deterministic communication vs. partition number. In Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS’15). IEEE, 1077--1088. Google Scholar
Digital Library
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2017. Query-to-communication lifting for BPP. In Proceedings of the 58th Symposium on Foundations of Computer Science (FOCS’17). IEEE, 132--143.Google Scholar
Cross Ref
- Rahul Jain and Hartmut Klauck. 2010. The partition bound for classical communication complexity and query complexity. In Proceedings of the 25th Conference on Computational Complexity (CCC’10). IEEE, 247--258. Google Scholar
Digital Library
- Rahul Jain, Hartmut Klauck, and Miklos Santha. 2010. Optimal direct sum results for deterministic and randomized decision tree complexity. Inform. Process. Lett. 110, 20 (2010), 893--897. Google Scholar
Digital Library
- Rahul Jain, Troy Lee, and Nisheeth Vishnoi. 2014. A Quadratically Tight Partition Bound for Classical Communication Complexity and Query Complexity. Technical Report. arXiv:1401.4512Google Scholar
- T. S. Jayram, Swastik Kopparty, and Prasad Raghavendra. 2009. On the communication complexity of read-once AC0 formulae. In Proceedings of the 24th Conference on Computational Complexity (CCC’09). IEEE, 329--340. Google Scholar
Digital Library
- Stasys Jukna. 2012. Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics, Vol. 27. Springer. Google Scholar
Digital Library
- Jedrzej Kaniewski, Troy Lee, and Ronald de Wolf. 2015. Query complexity in expectation. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15). Springer, 761--772.Google Scholar
Cross Ref
- Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, and David Xiao. 2015. Lower bounds on information complexity via zero-communication protocols and applications. SIAM J. Comput. 44, 5 (2015), 1550--1572.Google Scholar
Cross Ref
- Gillat Kol, Shay Moran, Amir Shpilka, and Amir Yehudayoff. 2014. Approximate nonnegative rank is equivalent to the smooth rectangle bound. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14). Springer, 701--712.Google Scholar
Cross Ref
- Robin Kothari, David Racicot-Desloges, and Miklos Santha. 2015. Separating decision tree complexity from subcube partition complexity. In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM’15). Schloss Dagstuhl, 915--930.Google Scholar
- Eyal Kushilevitz. 1994. Unpublished. (1994). Cited in {36}.Google Scholar
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press. Google Scholar
Digital Library
- Nikos Leonardos and Michael Saks. 2010. Lower bounds on the randomized communication complexity of read-once functions. Comput. Complex. 19, 2 (2010), 153--181. Google Scholar
Digital Library
- László Lovász and Michael Saks. 1988. Lattices, Möbius functions and communication complexity. In Proceedings of the 29th Symposium on Foundations of Computer Science (FOCS’88). IEEE, 81--90. Google Scholar
Digital Library
- Sagnik Mukhopadhyay and Swagato Sanyal. 2015. Towards better separation between deterministic and randomized query complexity. In Proceedings of the 35th Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS’15). Schloss Dagstuhl, 206--220.Google Scholar
- Noam Nisan and Avi Wigderson. 1995. On rank vs. communication complexity. Combinatorica 15, 4 (1995), 557--565.Google Scholar
Cross Ref
- Petr Savický. 2002. On Determinism Versus Unambiguous Nondeterminism for Decision Trees. Technical Report TR02-009. Electronic Colloquium on Computational Complexity (ECCC). Retrieved from http://eccc.hpi-web.de/report/2002/009/.Google Scholar
- Thomas Watson. 2017. Communication complexity of statistical distance. In Proceedings of the 21st International Workshop on Randomization and Computation (RANDOM’17). Schloss Dagstuhl, 49:1--49:10.Google Scholar
- Mihalis Yannakakis. 1991. Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43, 3 (1991), 441--466.Google Scholar
Cross Ref
Index Terms
Randomized Communication versus Partition Number
Recommendations
Deterministic Communication vs. Partition Number
We show that deterministic communication complexity can be superlogarithmic in the partition number of the associated communication matrix. We also obtain near-optimal deterministic lower bounds for the Clique vs. Independent Set problem, which in ...
Broadcasting in undirected ad hoc radio networks
Special issue: PODC 02We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in ...
Energy efficient randomised communication in unknown AdHoc networks
SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architecturesThis paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of the total ...






Comments