Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Mathieu Lauriere:

TR23-041 | 1st April 2023
Lila Fontes, Sophie Laplante, Mathieu Lauriere, Alexandre Nolin

The communication complexity of functions with large outputs

We study the two-party communication complexity of functions with large outputs, and show that the communication complexity can greatly vary depending on what output model is considered. We study a variety of output models, ranging from the open model, in which an external observer can compute the outcome, to the ... more >>>

ISSN 1433-8092 | Imprint