Bivariate triangular decompositions in the presence of asymptotes
From MaRDI portal
Publication:512372
Recommendations
- Multiplicity-preserving triangular set decomposition of two polynomials
- Irredundant triangular decomposition
- Algorithms for computing triangular decompositions of polynomial systems
- Complexity of triangular representations of algebraic sets
- On the asymptotic and practical complexity of solving bivariate systems over the reals
Cites work
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- Algorithms in real algebraic geometry
- An elementary approach to subresultants theory.
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Computing differential characteristic sets by change of ordering
- Modern computer algebra
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the exact computation of the topology of real algebraic curves
- Separating linear forms and rational univariate representations of bivariate systems
- Solving bivariate systems using rational univariate representations
- Sylvester-Habicht sequences and fast Cauchy index computation
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Using Algebraic Geometry
Cited in
(4)
This page was built for publication: Bivariate triangular decompositions in the presence of asymptotes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512372)