#матлог #учёба #спецсеминар

Kolmogorov seminar on complexity (for receive the zoom link, please email nikolay.vereshchagin@gmail.com)

Date: Dec 9, 2024. Time: 18:30 (MSK), 16:30 (CET)
Speaker: Andrey Storozhenko, UCLA
Title: The communication complexity of approximating matrix rank

Alice and Bob have on input two n times n matrices A and B, respectively. They want to compute or, at least, approximate the rank of the sum of their matrices A + B. The talk will be devoted to the communication complexity of this task and its applications for the problem of approximating the rank of a matrix by streaming algorithms.

The paper:
https://www.computer.org/csdl/proceedings-article/focs/2024/167400a433/22gEX3OxrJS

🔗 CSDL | IEEE Computer Society


➰ ВК