The following pages link to (Q4352810):
Displaying 11 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- A normal form algorithm for regular differential chains (Q541963) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)? (Q651871) (← links)
- Computing differential characteristic sets by change of ordering (Q1034554) (← links)
- On the theories of triangular sets (Q1808664) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Inversion Modulo Zero-Dimensional Regular Chains (Q2915000) (← links)
