Algorithms for computing sparse shifts for multivariate polynomials
From MaRDI portal
Publication:1583886
DOI10.1007/s002000050004zbMath0968.68199OpenAlexW1989520073MaRDI QIDQ1583886
Dima Yu. Grigoriev, Y. N. Lakshman
Publication date: 10 September 2001
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000050004
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Approximation algorithms (68W25)
Related Items (3)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases ⋮ Reconstruction algorithms for sums of affine powers ⋮ Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations
This page was built for publication: Algorithms for computing sparse shifts for multivariate polynomials
