Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the communication complexity of finding a king in a tournament (2402.14751v1)

Published 22 Feb 2024 in cs.CC and quant-ph

Abstract: A tournament is a complete directed graph. A king in a tournament is a vertex v such that every other vertex is reachable from v via a path of length at most 2. It is well known that every tournament has at least one king, one of which is a maximum out-degree vertex. The tasks of finding a king, a maximum out-degree vertex and a source in a tournament has been relatively well studied in the context of query complexity. We study the communication complexity of these tasks, where the edges are partitioned between two players. The following are our main results for n-vertex tournaments: 1) The deterministic communication complexity of finding whether a source exists is tilde{Theta}(log2 n). 2) The deterministic and randomized communication complexities of finding a king are Theta(n). The quantum communication complexity is tilde{Theta}(sqrt{n}). 3) The deterministic, randomized and quantum communication complexities of finding a maximum out-degree vertex are Theta(n log n), tilde{Theta}(n) and tilde{Theta}(sqrt{n}), respectively. Our upper bounds hold for all partitions of edges, and the lower bounds for a specific partition of the edges. To show the first bullet above, we show, perhaps surprisingly, that finding a source in a tournament is equivalent to the well-studied Clique vs. Independent Set (CIS) problem on undirected graphs. Our bounds for finding a source then follow from known bounds on the complexity of the CIS problem. In view of this equivalence, we can view the task of finding a king in a tournament to be a natural generalization of CIS. One of our lower bounds uses a fooling-set based argument, and all our other lower bounds follow from carefully-constructed reductions from Set-Disjointness.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Quantum search of spatial regions. Theory Comput., 1(1):47–79, 2005.
  2. Sorting and selection with imprecise comparisons. ACM Trans. Algorithms, 12(2):19:1–19:19, 2016.
  3. Kazuyuki Amano. Some improved bounds on communication complexity via new decomposition of cliques. Discrete Applied Mathematics, 166:249–254, 2014.
  4. Unambiguous dnfs and alon-saks-seymour. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 116–124. IEEE, 2021.
  5. Quantum vs. classical communication and computation. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 63–68. ACM, 1998.
  6. Complexity classes in communication complexity theory (preliminary version). In 27th Annual Symposium on Foundations of Computer Science, pages 337–347. IEEE Computer Society, 1986.
  7. Finding kings in tournaments. Discret. Appl. Math., 322:240–252, 2022.
  8. Bipartite perfect matching as a real polynomial. In STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1118–1131. ACM, 2021.
  9. Finding scores in tournaments. Journal of Algorithms, 24(2):380–394, 1997.
  10. Nearly optimal communication and query complexity of bipartite matching. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 1174–1185. IEEE, 2022.
  11. Randomized versus deterministic decision tree size. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC, pages 867–880. ACM, 2023.
  12. Improved quantum query upper bounds based on classical decision trees. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, volume 250 of LIPIcs, pages 15:1–15:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  13. A quantum algorithm for finding the minimum. arXiv preprint quant-ph/9607014, 1996.
  14. On (simple) decision tree rank. Theoretical Computer Science, 978:114177, 2023.
  15. P Ďuriš and Pavel Pudlák. On the communication complexity of planarity. In Fundamentals of Computation Theory: International Conference FCT’89 Szeged, Hungary, August 21–25, 1989 Proceedings 7, pages 145–147. Springer, 1989.
  16. Learning decision trees from random examples. Information and Computation, 82(3):231–246, 1989.
  17. Computing with unreliable information (preliminary version). In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 128–137. ACM, 1990.
  18. Mika Göös. Lower bounds for clique vs. independent set. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS, pages 1066–1076. IEEE Computer Society, 2015.
  19. Deterministic communication vs. partition number. SIAM J. Comput., 47(6):2435–2450, 2018.
  20. On the communication complexity of graph properties. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 186–191. ACM, 1988.
  21. A counterexample to the alon-saks-seymour conjecture and related problems. Combinatorica, 32(2):205–219, 2012.
  22. New bounds on the classical and quantum communication complexity of some graph properties. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, volume 18 of LIPIcs, pages 148–159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.
  23. The linear-array conjecture in communication complexity is false. Combinatorica, 19(2):241–254, 1999.
  24. Communication Complexity. Cambridge University Press, 1997.
  25. The probabilistic communication complexity of set intersection. SIAM J. Discret. Math., 5(4):545–557, 1992.
  26. HG Landau. On dominance relations and the structure of animal societies: Iii the condition for a score structure. The bulletin of mathematical biophysics, 15:143–148, 1953.
  27. When you come at the king you best not miss. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, volume 250 of LIPIcs, pages 25:1–25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  28. L. Lovasz and M. Saks. Lattices, mobius functions and communications complexity. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pages 81–90, 1988.
  29. Stephen B Maurer. The king chicken theorems. Mathematics Magazine, 53(2):67–80, 1980.
  30. Randomized and quantum query complexities of finding a king in a tournament. In 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, volume 284 of LIPIcs, pages 30:1–30:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  31. Noam Nisan. The communication complexity of threshold gates. Combinatorics, Paul Erdos is Eighty, 1:301–315, 1993.
  32. Noam Nisan. The demand query model for bipartite matching. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 592–599. SIAM, 2021.
  33. A lower bound for DLL algorithms for k-sat (preliminary version). In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 128–136. ACM/SIAM, 2000.
  34. Alexander A. Razborov. On the distributional complexity of disjointness. Theor. Comput. Sci., 106(2):385–390, 1992.
  35. Alexander Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences, mathematics, 67(1):159–176, 2003. quant-ph/0204025.
  36. Ordered biclique partitions and communication complexity problems. Discrete Applied Mathematics, 184:248–252, 2015.
  37. Searching for sorted sequences of kings in tournaments. SIAM J. Comput., 32(5):1201–1209, 2003.
  38. Ronald de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):337–353, 2002.
  39. Mihalis Yannakakis. Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci., 43(3):441–466, 1991.
  40. Andrew Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA, pages 209–213, 1979.
  41. Andrew Chi-Chih Yao. Quantum circuit complexity. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science (FOCS), pages 352–361. IEEE, 1993.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now