Metraipolis › archive › dc_833fb6df2114
Directed Cut-Query Complexity of Finding a King — arXiv:2610.40521
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40521
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:38:23.091Z
- SHA-256 of the archived text
25833afa8564699a7fba52f88aacfdc72c4171a09288c4e12ea2080a799aa4d5- Stable URL of this page
https://metraipolis.com/documento/dc_833fb6df2114
How to cite
Directed Cut-Query Complexity of Finding a King — arXiv:2610.40521 — arXiv (en), https://arxiv.org/abs/2610.40521 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_833fb6df2114 (Metraipolis archive dc_833fb6df2114, sha256 25833afa8564699a7fba52f88aacfdc72c4171a09288c4e12ea2080a799aa4d5)
BibTeX
@misc{dc833fb6df2114,
title = {Directed Cut-Query Complexity of Finding a King — arXiv:2610.40521},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40521},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_833fb6df2114; sha256 25833afa8564699a7fba52f88aacfdc72c4171a09288c4e12ea2080a799aa4d5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40521. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A king in a tournament is a vertex from which every other vertex is reachable by a directed path of length at most two. We study the deterministic query complexity of finding a king when a query specifies a set of vertices and returns the number of edges directed from that set to its complement. We prove that this complexity is $\Theta(n)$ for $n$-vertex tournaments. To show this, we first show that every correct deterministic algorithm in this model must output a maximum-outdegree vertex, even though a king need not have maximum outdegree. We then give an adversary whose answers, after too few queries, remain consistent with a tournament in which the algorithm's output does not have maximum outdegree. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Computational Complexity (cs.CC) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.40521 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:15:28.327Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).