Pages that link to "Item:Q1808664"
From MaRDI portal
The following pages link to On the theories of triangular sets (Q1808664):
Displaying 50 items.
- Automatic constructibility checking of a corpus of geometric construction problems (Q294375) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Rational general solutions of higher order algebraic ODEs (Q394458) (← links)
- An improved algorithm for deciding semi-definite polynomials (Q404554) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- A criterion for testing whether a difference ideal is prime (Q473046) (← links)
- Triangular systems and a generalization of primitive polynomials (Q480664) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- A test for monomial containment (Q512370) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- A normal form algorithm for regular differential chains (Q541963) (← links)
- CAD and topology of semi-algebraic sets (Q626978) (← 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)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Computing with algebraically closed fields (Q846355) (← links)
- Involutions of polynomially parametrized surfaces (Q893108) (← links)
- Generic regular decompositions for parametric polynomial systems (Q905159) (← links)
- Probabilistic algorithms for computing resolvent representations of regular differential ideals (Q985372) (← links)
- A characteristic set method for ordinary difference polynomial systems (Q1006653) (← links)
- Complete numerical isolation of real roots in zero-dimensional triangular systems (Q1025386) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Characteristic set method for differential-difference polynomial systems (Q1030248) (← links)
- Dynamic balancing of planar mechanisms using toric geometry (Q1030265) (← links)
- Computing differential characteristic sets by change of ordering (Q1034554) (← links)
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. (Q1416272) (← links)
- Factorization-free decomposition algorithms in differential algebra (Q1569835) (← links)
- Computing triangular systems and regular systems (Q1582304) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- Specifications for triangulation algorithms of elementary-algebraic systems (Q1598480) (← links)
- Using jointly geometry and algebra to determine RC-constructibility (Q1640643) (← links)
- Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems (Q1730301) (← links)
- On the mechanization of straightedge and compass constructions (Q1730306) (← links)
- Elimination theory in differential and difference algebra (Q1730314) (← links)
- An equivalence theorem for regular differential chains (Q1733300) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- An algorithm for isolating the real solutions of semi-algebraic systems (Q1864897) (← links)
- Real solving for positive dimensional systems. (Q1867000) (← links)
- Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Rational general solutions of trivariate rational differential systems (Q1949083) (← links)
- On solving parametric polynomial systems (Q1949089) (← links)
- A short contribution to the theory of regular chains (Q2035618) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition (Q2061992) (← links)
- Symbolic computation for the qualitative theory of differential equations (Q2080988) (← links)
