Algorithms for computing sparse shifts for multivariate polynomials
DOI10.1007/S002000050004zbMATH Open0968.68199OpenAlexW1989520073MaRDI QIDQ1583886FDOQ1583886
Authors: Dima 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
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
complexity[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]shifted sparse polynomials
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Approximation algorithms (68W25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (7)
- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
- Sparse shifts for univariate polynomials
- Title not available (Why is that?)
- Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
- Sparse multiplication for skew polynomials
- Title not available (Why is that?)
- 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)
