With unlimited interaction, k-step pointer chasing still requires Ω(k log(n/k)) randomized communication (or Ω(k log log k) for zero error), so the trivial k-round protocol is near-optimal.
In: 22nd An- nual IEEE Conference on Computational Complexity (CCC)
1 Pith paper cite this work, alongside 28 external citations. Polarity classification is still indexing.
1
Pith paper citing it
28
external citations · OpenAlex
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pointer Chasing with Unlimited Interaction
With unlimited interaction, k-step pointer chasing still requires Ω(k log(n/k)) randomized communication (or Ω(k log log k) for zero error), so the trivial k-round protocol is near-optimal.