Some bounds on multiparty communication complexity of pointer jumping
From MaRDI portal
Publication:1272658
DOI10.1007/PL00001595zbMath0912.68052MaRDI QIDQ1272658
Carsten Damm, Jiří Sgall, Stasys P. Jukna
Publication date: 18 May 1999
Published in: Computational Complexity (Search for Journal in Brave)
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of computing (68Q99)
Related Items (6)
Superlinear lower bounds for multipass graph processing ⋮ The function-inversion problem: barriers and opportunities ⋮ Optimal collapsing protocol for multiparty pointer jumping ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ The communication complexity of pointer chasing ⋮ Pointer chasing via triangular discrimination
This page was built for publication: Some bounds on multiparty communication complexity of pointer jumping
