The following pages link to RegularChains (Q13544):
Displaying 12 items.
- Computing the canonical representation of constructible sets (Q294390) (← links)
- Model reduction of chemical reaction systems using elimination (Q359898) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- Formal algorithmic elimination for PDEs (Q468363) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← 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)
- Computational schemes for subresultant chains (Q831961) (← links)
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (Q2829999) (← links)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties (Q5018379) (← links)
