Testing polynomial equivalence by scaling matrices

DOI10.1007/978-3-662-55751-8_10zbMATH Open1496.68377OpenAlexW2745930696MaRDI QIDQ1679963FDOQ1679963

Authors: Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma M. N. 

Publication date: 22 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-662-55751-8_10

Recommendations

• Efficient algorithms for some special cases of the polynomial equivalence problem
• Testing equivalence of polynomials under shifts
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• scientific article; zbMATH DE number 1254274
• Equivalence of polynomials under automorphisms of \(\mathbb{C}^2\)

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Real and complex fields (12D99)

Cited In (2)

• Testing matrix function algorithms using identities
• Efficient algorithms for some special cases of the polynomial equivalence problem

This page was built for publication: Testing polynomial equivalence by scaling matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679963)