Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR26-324 | 20th November 2026 18:12

A power saving for pointer chasing

RSS-Feed




TR26-324
Authors: Emanuele Viola
Publication: 20th November 2026 18:12
Downloads: 47
Keywords: 


Abstract:

Three-player number-on-forehead pointer chasing has communication complexity $\le n^{1-c}$. A bound $n/\log^{c}n$ was known since the 90's.



ISSN 1433-8092 | Imprint