Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
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)[superscript n+2] tabulated values of P to produce the value of P at any of the q[super...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer US
2018
|
| Online Access: | http://hdl.handle.net/1721.1/118295 https://orcid.org/0000-0003-2326-2233 |