An algebraic approach to communication complexity
From MaRDI portal
Recommendations
- Algebraic techniques in communication complexity
- Communication Complexity in Algebraic Two-Party Protocols
- Linear algebraic methods in communication complexity
- On the communication complexity of distributed algebraic computation
- Communication complexity and combinatorial lattice theory
- scientific article; zbMATH DE number 107798
- Communication Complexity
- scientific article; zbMATH DE number 3936520
Cited in
(12)- Communication complexity and combinatorial lattice theory
- Space complexity of reachability testing in labelled graphs
- Learning expressions and programs over monoids
- The communication complexity of interleaved group products
- scientific article; zbMATH DE number 3880845 (Why is no real title available?)
- On the Non-deterministic Communication Complexity of Regular Languages
- On Toda’s Theorem in Structural Communication Complexity
- A direct sum theorem in communication complexity via message compression
- MONOIDS AND COMPUTATIONS
- scientific article; zbMATH DE number 894723 (Why is no real title available?)
- scientific article; zbMATH DE number 6308216 (Why is no real title available?)
- Space Complexity of Reachability Testing in Labelled Graphs
This page was built for publication: An algebraic approach to communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4219022)