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

21 July 2021

Edgar Solomonik

Papers citing "Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products"

Title
No papers