Algorithms for computing sparse shifts for multivariate polynomials
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1254239
- scientific article; zbMATH DE number 1263400
- Computing sparse multiples of polynomials
- Computing sparse multiples of polynomials
- Sparse shifts for univariate polynomials
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
- On some computations on sparse polynomials
- A new algorithm for sparse interpolation of multivariate polynomials
- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
Cited in
(7)- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
- Sparse shifts for univariate polynomials
- scientific article; zbMATH DE number 1254239 (Why is no real title available?)
- Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
- Sparse multiplication for skew polynomials
- scientific article; zbMATH DE number 5263329 (Why is no real title available?)
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
This page was built for publication: Algorithms for computing sparse shifts for multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583886)