Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
From MaRDI portal
(Redirected from Publication:1033892)
Recommendations
Cites work
- scientific article; zbMATH DE number 3846865 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- 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 square-free factorization of multivariate polynomials over a finite field.
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Subquadratic-time factoring of polynomials over finite fields
Cited in
(7)- Solution of polynomial equations in the field of algebraic numbers
- scientific article; zbMATH DE number 3627285 (Why is no real title available?)
- 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}$
- scientific article; zbMATH DE number 177873 (Why is no real title available?)
- 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)
