2 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
(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…
A note on Ordered Ruzsa-Szemerédi graphs
Kevin Pratt
A recent breakthrough of Behnezhad and Ghafari [FOCS 2024] and subsequent work of Assadi, Khanna, and Kiss [SODA 2025] gave algorithms for the fully dynamic -appro…
An Algorithmic Method of Partial Derivatives
Cornelius Brand, Kevin Pratt
We study the following problem and its applications: given a homogeneous degree- polynomial as an arithmetic circuit, and a matrix whose entries are homogen…
Waring Rank, Parameterized and Exact Algorithms
Kevin Pratt
Given nonnegative integers and , where , what is the minimum number such that there exist linear forms …