Reproduce “Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Caleb Ju, Yifan Zhang, Edgar Solomonik
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.