A note on abnormal polynomial remainder sequences
Abstract
References
Recommendations
Improved polynomial remainder sequences for Ore polynomials
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders. Different ways ...
Subresultants and Reduced Polynomial Remainder Sequences
Let @@@@ be an integral domain, P(@@@@) the integral domain of polynomials over @@@@. Let P, Q ∈ P(@@@@) with m @@@@ deg (P) ≥ n = deg (Q) > 0. Let M be the matrix whose determinant defines the resultant of P and Q. Let Mij be the submatrix of M ...
Primitive polynomial remainder sequences in elimination theory
Primitive polynomial remainder sequences (pprs) are more than a tool for computing gcd's; the content computations in the course of computing the pprs of two multivariate polynomialsf1 andf2 provide information on the common zeros off1 andf2. Because of ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 109Total Downloads
- Downloads (Last 12 months)46
- Downloads (Last 6 weeks)6
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in