activity
20042021
most citedAn additive combinatorics approach to the log-rank conjecture in communication complexity

6 citations · 14 across the 5 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021★ 2 cited

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

Eli Ben-Sasson, Dan Carmon, Swastik Kopparty +1

For smooth finite fields (i.e., when factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomi…