Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MANON BLANC:
All reports by Author Manon Blanc:

TR26-182 | 16th September 2026
Manon Blanc, Prateek Dwivedi, Nutan Limaye, Meena Mahajan, Magnus Rahbek Dalgaard Hansen

Tight Lower Bounds for Algebraic Communication and Applications

Revisions: 1

Communication complexity studies how much information must be exchanged to solve a problem whose input is split among several parties. The classical setting deals with Boolean inputs split between two parties. We study an algebraic variant, where the inputs are vectors over a field $\mathbb{F} \in \{\mathbb{R}, \mathbb{C}\}$. Alice and ... more >>>




ISSN 1433-8092 | Imprint