scientific article; zbMATH DE number 1263400

MaRDI QIDQ4234292zbMATH OpenFDO

Authors Y. N. Lakshman, B. David Saunders

Publication date 16 September 1999

zbMATH Keywords

algorithmrational shiftssparse shifts for univariate polynomialsuniqueness of shifts

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05)

Recommendations

• Sparse shifts for univariate polynomials
• scientific article; zbMATH DE number 1254239
• Algorithms for computing sparse shifts for multivariate polynomials
• Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

Cited in

(8)

• Sparse shifts for univariate polynomials
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• scientific article; zbMATH DE number 1254239 (Why is no real title available?)
• Fast construction of constant bound functions for sparse polynomials
• Interpolation of shifted-lacunary 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 Q4234292)