Optimizations of the subresultant algorithm
From MaRDI portal
Recommendations
- A Subexponential Algorithm for Abstract Optimization Problems
- scientific article; zbMATH DE number 1256684
- On the efficiency of subsumption algorithms
- Optimum algorithm for maximization of submodular functions
- Subexponential parameterized algorithms
- Subexponential Parameterized Algorithms
- scientific article; zbMATH DE number 1253989
- Optimization of a subclass of conjunctive queries
- scientific article; zbMATH DE number 219223
- Generalized algorithm for summing the enumerators of suboptimal solutions
Cited in
(33)- Computing differential characteristic sets by change of ordering
- An elementary approach to subresultants theory.
- Subresultants revisited.
- New structure theorem for subresultants
- Speeding up the GVW algorithm via a substituting method
- On the complexity of the Lickteig-Roy subresultant algorithm
- Computation of the dual of a plane projective curve
- Towards faster real algebraic numbers
- Subresultant chains using Bézout matrices
- Subresultants of two Hermite-Laurent series
- A verified implementation of algebraic numbers in Isabelle/HOL
- Birational properties of the gap subresultant varieties
- Symmetric subresultants and applications
- Subresultants with the Bézout matrix
- An incremental algorithm for computing cylindrical algebraic decompositions
- Algorithme de Bareiss, algorithme des sous-résultants
- scientific article; zbMATH DE number 3876581 (Why is no real title available?)
- Thomas decomposition of algebraic and differential systems
- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
- Algorithms for computing triangular decomposition of polynomial systems
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1273655 (Why is no real title available?)
- D-resultant and subresultants
- Basic polynomial algebra subprograms
- Probabilistic algorithms for computing resultants
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Topics in computational algebraic number theory
- Division-free computation of subresultants using Bezout matrices
- Levelwise construction of a single cylindrical algebraic cell
- Computational schemes for subresultant chains
- Generalized algorithm for summing the enumerators of suboptimal solutions
- Recursive polynomial remainder sequence and its subresultants
- Properties of regular systems and algorithmic improvements for regular decomposition
This page was built for publication: Optimizations of the subresultant algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963982)
