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...
Autori principali: | Williams, Richard Ryan, Björklund, Andreas, Kaski, Petteri |
---|---|
Altri autori: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Natura: | Articolo |
Lingua: | English |
Pubblicazione: |
2021
|
Accesso online: | https://hdl.handle.net/1721.1/137359 |
Documenti analoghi
-
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
di: Björklund, Andreas, et al.
Pubblicazione: (2018) -
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
di: Williams, Richard Ryan, et al.
Pubblicazione: (2021) -
On the Eneström–Kakeya theorem for quaternionic polynomials
di: Mir, Abdullah, et al.
Pubblicazione: (2023-09-01) -
Kakeya sets and the method of multiplicities
di: Saraf, Shubhangi
Pubblicazione: (2010) -
Rotation Inside Convex Kakeya Sets
di: Janzer, B
Pubblicazione: (2024)