Sparse polynomial interpolation: faster strategies over finite fields - Département d'informatique Access content directly
Journal Articles Applicable Algebra in Engineering, Communication and Computing Year : 2024

Sparse polynomial interpolation: faster strategies over finite fields

Domains

Symbolic Computation [cs.SC] Computer Arithmetic Computational Complexity [cs.CC] Data Structures and Algorithms [cs.DS] Mathematical Software [cs.MS] Probability [math.PR]
Fichier principal
Vignette du fichier
ffsparse-v3.pdf (423.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Joris van der Hoeven  : Connect in order to contact the contributor

https://hal.science/hal-02382117

Submitted on : Wednesday, May 1, 2024-12:51:28 AM

Last modification on : Saturday, May 4, 2024-3:15:53 AM

Download

Dates and versions

hal-02382117 , version 1 (27-11-2019)
hal-02382117 , version 2 (01-05-2024)

Identifiers

Cite

Joris van der Hoeven, Grégoire Lecerf. Sparse polynomial interpolation: faster strategies over finite fields. Applicable Algebra in Engineering, Communication and Computing, 2024, ⟨10.1007/s00200-024-00655-5⟩. ⟨hal-02382117v2⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS LIX X-LIX X-DEP-INFO IP_PARIS
139 View
200 Download

Altmetric

Share

Gmail Facebook X LinkedIn More