Computer Algebra of Polynomials and Rational Functions
From MaRDI portal
Publication:4401061
DOI10.2307/2318161zbMath0275.68008OpenAlexW4239375808MaRDI QIDQ4401061
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
Numerical computation of solutions to single equations (65H05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)
Related Items
Computability Models: Algebraic, Topological and Geometric Algorithms, Exact Solution of Systems of Linear Equations with Iterative Methods, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, Univariate polynomial factorization over finite fields, Algorithms, complexity and discreteness criteria in \(PSL(2,C)\), Factorization ofm-D polynomials in linearm-D factors, Double Sylvester sums for subresultants and multi-Schur functions., Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity, Subresultants revisited., Validity proof of Lazard's method for CAD construction, Detecting algebraic curves in bad position, Klassifizierung torsionsfreier abelscher Gruppen des Ranges 2. II, Least order, stable solution of the exact model matching problem, Unnamed Item, A general factorization method for multivariable polynomials
