Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
DOI10.1134/S0001434609010076zbMATH Open1173.13318MaRDI QIDQ1033892FDOQ1033892
Authors: A. É. Maevskii 
Publication date: 10 November 2009
Published in: Mathematical Notes (Search for Journal in Brave)
Recommendations
polynomial ringdeterministic algorithmintegral domainalgebraic-geometric codearithmetic complexityroot of a polynomialprincipal prime ideal
Polynomials, factorization in commutative rings (13P05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Title not available (Why is that?)
- Subquadratic-time factoring of polynomials over finite fields
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- 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
- On square-free factorization of multivariate polynomials over a finite field.
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Solution of polynomial equations in the field of algebraic numbers
- Algorithmic search for integer abelian roots of a polynomial with integer abelian coefficients
- Algorithm for computing the truncation of the discriminant of a polynomial
- Counting roots of polynomials over $\mathbb{Z}/p^2\mathbb{Z}$
- Title not available (Why is that?)
- Numerical root finding via Cox rings
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1033892)
