12 citations · 27 across the 28 of their papers we have counts for
Showing cs.DSShow all
2 papers · 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…
cs.DS2014★ 1 cited
Simultaneous Approximation of Constraint Satisfaction Problems
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
Given collections of 2SAT clauses on the same set of variables , can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such…