2000 character limit reached
Communication complexity of pointer chasing via the fixed-set lemma (2507.08919v1)
Published 11 Jul 2025 in cs.CC
Abstract: I give a very simple, apparently new proof of a tight communication lower bound for pointer chasing.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.