ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2107.09834
  4. Cited By
Communication lower bounds for nested bilinear algorithms via rank
  expansion of Kronecker products
v1v2v3v4 (latest)

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

21 July 2021
Caleb Ju
Yifan Zhang
Edgar Solomonik
ArXiv (abs)PDFHTML

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

Title
No papers