The Subresultant PRS Algorithm
From MaRDI portal
Cited in
(21)- Improved polynomial remainder sequences for Ore polynomials
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Algebraic numbers in Isabelle/HOL
- A verified implementation of algebraic numbers in Isabelle/HOL
- Factoring multivariate polynomials over finite fields
- An efficient method for analyzing the topology of plane real algebraic curves.
- Exact, efficient, and complete arrangement computation for cubic curves
- Multiplicity-preserving triangular set decomposition of two polynomials
- Power series remainder sequences and Padé fractions over an integral domain
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- Subresultants revisited.
- RGIsearch: a C++ program for the determination of renormalization group invariants
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Computer algebra: Past and future
- Primitive polynomial remainder sequences in elimination theory
- 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)
- Three new algorithms for multivariate polynomial GCD
- A fraction free matrix Berlekamp/Massey algorithm
- Theory of multiple polynomial remainder sequence
This page was built for publication: The Subresultant PRS Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166225)
