The following pages link to (Q3568131):
Displayed 9 items.
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- A constructive approach to quasi-steady state reductions (Q500704) (← links)
- A normal form algorithm for regular differential chains (Q541963) (← links)
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)? (Q651871) (← links)
- A bound for the Rosenfeld-Gröbner algorithm (Q928772) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Computing differential characteristic sets by change of ordering (Q1034554) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)