Some bounds on multiparty communication complexity of pointer jumping

DOI10.1007/3-540-60922-9_52zbMath1379.68128OpenAlexW2147448298MaRDI QIDQ4593967

Carsten Damm, Jiří Sgall, Stasys P. Jukna

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs

This page was built for publication: Some bounds on multiparty communication complexity of pointer jumping