The ``log rank conjecture for modular communication complexity

DOI10.1007/3-540-60922-9_50MaRDI QIDQ4593965zbMATH OpenOpenAlexFDO

Authors Christoph Meinel, Stephan Waack

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)

Recommendations

• The log rank conjecture for modular communication complexity
• On the ``log rank-conjecture in communication complexity
• On rank vs. communication complexity
• En route to the log-rank conjecture: new reductions and equivalent formulations
• The log-rank conjecture and low degree polynomials

Cited in

(11)

• On Toda’s Theorem in Structural Communication Complexity
• The log rank conjecture for modular communication complexity
• Lower bounds for the modular communication complexity of various graph accessibility problems
• The log-approximate-rank conjecture is false
• On rank vs. communication complexity
• On a theorem of Razborov
• On the ``log rank-conjecture in communication complexity
• En route to the log-rank conjecture: new reductions and equivalent formulations
• The corruption bound, log-rank, and communication complexity
• Min-rank conjecture for log-depth circuits
• Recent advances on the log-rank conjecture in communication complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593965)