Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
© 2018 Andreas Björklund, Petteri Kaski, and Ryan Williams. We present two new data structures for computing values of an n-variate polynomial P of degree at most d over a finite field of q elements. Assuming that d divides q-1, our first data structure relies on (d+1)n+2 tabulated values of P to pr...
Main Authors: | Williams, Richard Ryan, Björklund, Andreas, Kaski, Petteri |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137359 |
Similar Items
Similar Items
-
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
by: Björklund, Andreas, et al.
Published: (2018) -
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
by: Williams, Richard Ryan, et al.
Published: (2021) -
Kakeya sets and the method of multiplicities
by: Saraf, Shubhangi
Published: (2010) -
Rotation Inside Convex Kakeya Sets
by: Janzer, B
Published: (2024) -
Polynomial Wolff axioms and Kakeya-type estimates in R4
by: Guth, Lawrence, et al.
Published: (2018)