Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Improved Sparse Recovery for Approximate Matrix Multiplication
Yahel Uffenheimer, Omri Weinstein
We present a simple randomized algorithm for approximate matrix multiplication (AMM) whose error scales with the *output* norm . Given any matrices and…
cs.DS2025
(Approximate) Matrix Multiplication via Convolutions
Yahel Uffenheimer, Omri Weinstein
We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a s…