Communication Lower Bounds for Nested Bilinear Algorithms via Rank Expansion of Kronecker Products

标题
Communication Lower Bounds for Nested Bilinear Algorithms via Rank Expansion of Kronecker Products
作者
关键词
-
出版物
出版商
Springer Science and Business Media LLC
发表日期
2023-11-07
DOI
10.1007/s10208-023-09633-8

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started