Sparse multiplication of multivariate linear differential operators
From MaRDI portal
Publication:6666531
DOI10.1145/3452143.3465527WikidataQ131128971 ScholiaQ131128971MaRDI QIDQ6666531
Qiao-Long Huang, Éric Schost, Mark Giesbrecht
Publication date: 20 January 2025
Monte Carlo algorithmderivativeslinear differential operatorssparse polynomial interpolationsparse multiplication
Cites Work
- Interpolating polynomials from their values
- Matrix multiplication via arithmetic progressions
- On fast multiplication of polynomials over arbitrary algebras
- FFT-like multiplication of linear differential operators
- Early termination in sparse interpolation algorithms
- Newton-Hensel interpolation lifting
- Output-sensitive algorithms for sumset and sparse polynomial multiplication
- Powers of tensors and fast matrix multiplication
- Implementing the Tangent Graeffe Root Finding Method
- Fast Multiplication for Skew Polynomials
- What Can (and Can't) we Do with Sparse Polynomials?
- Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic
- Sparse multiplication for skew polynomials
- On the complexity of multivariate blockwise polynomial multiplication
- Products of ordinary differential operators by evaluation and interpolation
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Sparse multiplication of multivariate linear differential operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666531)
