Computer Algebra of Polynomials and Rational Functions

DOI10.2307/2318161MaRDI QIDQ4401061zbMATH OpenOpenAlexFDO

Authors George E. Collins

Publication date 1973

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2318161

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)

Cited in

(15)

• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• Univariate polynomial factorization over finite fields
• Klassifizierung torsionsfreier abelscher Gruppen des Ranges 2. II
• Least order, stable solution of the exact model matching problem
• A general factorization method for multivariable polynomials
• Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
• Double Sylvester sums for subresultants and multi-Schur functions.
• Subresultants revisited.
• Validity proof of Lazard's method for CAD construction
• Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
• Exact Solution of Systems of Linear Equations with Iterative Methods
• Factorization ofm-D polynomials in linearm-D factors
• scientific article; zbMATH DE number 1087966 (Why is no real title available?)
• Computability Models: Algebraic, Topological and Geometric Algorithms
• Detecting algebraic curves in bad position

This page was built for publication: Computer Algebra of Polynomials and Rational Functions

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