Pages that link to "Item:Q2635066"
From MaRDI portal
The following pages link to Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066):
Displaying 7 items.
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials (Q1704862) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Learning algebraic decompositions using Prony structures (Q2182612) (← links)
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs (Q2188992) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933) (← links)
