The “log rank” conjecture for modular communication complexity

DOI10.1007/3-540-60922-9_50zbMath1379.68175OpenAlexW1620111967MaRDI QIDQ4593965

Stephan Waack, Christoph Meinel

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_50

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

This page was built for publication: The “log rank” conjecture for modular communication complexity