Lower Bounds for Multiplication via Network Coding
From MaRDI portal
Publication:5091158
DOI10.4230/LIPIcs.ICALP.2019.10OpenAlexW2965168983MaRDI QIDQ5091158
Lior Kamma, Casper Benjamin Freksen, Kasper Green Larsen, Peyman Afshani
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1902.10935
Related Items
On directed analogues of expander and hyperfinite graph sequences ⋮ Efficient Generic Quotients Using Exact Arithmetic ⋮ A theory of composition for differential obliviousness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of integer matrix multiplication
- Information flows, graphs and their guessing numbers
- Fast multiplication of large numbers
- Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
- Faster Integer Multiplication
- A Lower Bound for Integer Multiplication with Read-Once Branching Programs
- Network coding in undirected graphs is either very helpful or not helpful at all
- Lower bounds for external memory integer sorting via network coding
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On the capacity of information networks
