The Subresultant PRS Algorithm

DOI10.1145/355791.355795zbMath0385.68044OpenAlexW1977340462MaRDI QIDQ4166225

W. S. Brown

Publication date: 1978

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355791.355795

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items

Theory of multiple polynomial remainder sequence, Primitive polynomial remainder sequences in elimination theory, Computer algebra: Past and future, RGIsearch: a C++ program for the determination of renormalization group invariants, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs), Subresultants revisited., A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, A fraction free matrix Berlekamp/Massey algorithm, Improved polynomial remainder sequences for Ore polynomials, Three new algorithms for multivariate polynomial GCD, Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm, Exact, efficient, and complete arrangement computation for cubic curves, Power series remainder sequences and Padé fractions over an integral domain, A verified implementation of algebraic numbers in Isabelle/HOL, Algebraic Numbers in Isabelle/HOL, A new method for computing polynomial greatest common divisors and polynomial remainder sequences, An efficient method for analyzing the topology of plane real algebraic curves., Multiplicity-preserving triangular set decomposition of two polynomials, Factoring multivariate polynomials over finite fields, Systems of rational polynomial equations have polynomial size approximate zeros on the average