scientific article; zbMATH DE number 1254239
From MaRDI portal
Publication:4227280
Recommendations
- Algorithms for computing sparse shifts for multivariate polynomials
- 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
(13)- Testing the shift-equivalence of polynomials using quantum machines
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Algorithms for computing sparse shifts for multivariate polynomials
- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
- Sparse shifts for univariate polynomials
- Computing sparse multiples of polynomials
- Computing sparse multiples of polynomials
- A local decision test for sparse polynomials
- scientific article; zbMATH DE number 1263400 (Why is no real title available?)
- Sparse multiplication for skew polynomials
- scientific article; zbMATH DE number 5263329 (Why is no real title available?)
- Shifted varieties and discrete neighborhoods around varieties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227280)
