scientific article; zbMATH DE number 1254274

MaRDI QIDQ4227323zbMATH OpenFDO

Authors Dima Grigoriev

Publication date 12 January 2000

zbMATH Keywords

quantum machinesshifted-sparse polynomials

Mathematics Subject Classification ID

Recommendations

• Testing the shift-equivalence of polynomials using quantum machines
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• Testing equivalence of polynomials under shifts
• Testing polynomial equivalence by scaling matrices

Cited in

(7)

• Testing the shift-equivalence of polynomials using quantum machines
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• Testing polynomial equivalence by scaling matrices
• On the existence of telescopers for rational functions in three variables
• An algorithm for deciding the summability of bivariate rational functions
• Testing equivalence of polynomials under shifts
• Symbolic summation of multivariate rational functions

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 Q4227323)