Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain

DOI10.1134/S0001434609010076zbMath1173.13318MaRDI QIDQ1033892

A. É. Maevskii

Publication date: 10 November 2009

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

polynomial ringintegral domainarithmetic complexitydeterministic algorithmalgebraic-geometric coderoot of a polynomialprincipal prime ideal

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• On square-free factorization of multivariate polynomials over a finite field.
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• Subquadratic-time factoring of polynomials over finite fields
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance

This page was built for publication: Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain