Fast arithmetic for triangular sets: from theory to practice
From MaRDI portal
(Redirected from Publication:5301681)
Fast arithmetic for triangular sets: from theory to practice (scientific article; zbMATH DE number 5494050)
Fast arithmetic for triangular sets: from theory to practice (scientific article; zbMATH DE number 5494050)
Recommendations
- Fast arithmetic for triangular sets: from theory to practice
- Homotopy techniques for multiplication modulo triangular sets
- Complexity results for triangular sets
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- On the complexity of computing with zero-dimensional triangular sets
Cited in
(13)- Fast arithmetic for triangular sets: from theory to practice
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
- Complexity results for triangular sets
- Multiplicity-preserving triangular set decomposition of two polynomials
- Fast vector arithmetic over \(\mathbb{F}_3\)
- Change of order for regular chains in positive dimension
- Computations modulo regular chains
- On the complexity of the D5 principle
- Algorithms for computing triangular decomposition of polynomial systems
- Fast arithmetics in Artin-Schreier towers over finite fields
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Homotopy techniques for multiplication modulo triangular sets
This page was built for publication: Fast arithmetic for triangular sets: from theory to practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301681)
