The log rank conjecture for modular communication complexity

DOI10.1007/PL00001612zbMath0998.68065OpenAlexW2018825639WikidataQ123079295 ScholiaQ123079295MaRDI QIDQ5957091

Christoph Meinel, Stephan Waack

Publication date: 28 February 2002

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001612

zbMATH Keywords

log rank conjecturemodular communication complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

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