From Surf Wiki (app.surf) — the open knowledge base
Log-rank conjecture
In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix.
Rendering article…
Content sourced from manual.
This content may have been generated or modified by AI, and may be sourced from third parties. CloudSurf Software LLC makes no warranties as to its accuracy, completeness, or reliability, and accepts no liability for it. Always verify important information against primary sources.
Report