scientific article; zbMATH DE number 1254239

zbMATH Open0924.68105MaRDI QIDQ4227280FDOQ4227280

Authors: Y. N. Lakshman, Dima Grigoriev 

Publication date: 18 May 1999

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (12)

• Shifted varieties and discrete neighborhoods around varieties
• A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
• Sparse shifts for univariate polynomials
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• A local decision test for sparse polynomials
• Sparse multiplication for skew polynomials
• Title not available (Why is that?)
• Computing sparse multiples of polynomials
• Computing sparse multiples of polynomials
• Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
• Testing the shift-equivalence of polynomials using quantum machines
• Algorithms for computing sparse shifts for multivariate polynomials

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)