The following pages link to (Q5301681):
Displaying 9 items.
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems (Q1730301) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
