Pages that link to "Item:Q1260758"
From MaRDI portal
The following pages link to A generalized Euclidean algorithm for computing triangular representations of algebraic varieties (Q1260758):
Displaying 50 items.
- Automatic constructibility checking of a corpus of geometric construction problems (Q294375) (← links)
- Computing the canonical representation of constructible sets (Q294390) (← 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)
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification (Q462854) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Bounding the number of limit cycles for a polynomial Liénard system by using regular chains (Q507129) (← links)
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers (Q611072) (← 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)
- Mechanical geometry theorem proving based on Gröbner bases (Q676849) (← links)
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time (Q809149) (← links)
- Generic regular decompositions for parametric polynomial systems (Q905159) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- A characteristic set method for ordinary difference polynomial systems (Q1006653) (← links)
- Computing representations for radicals of finitely generated differential ideals (Q1015366) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Computing differential characteristic sets by change of ordering (Q1034554) (← links)
- Factorization-free decomposition algorithms in differential algebra (Q1569835) (← links)
- Computing triangular systems and regular systems (Q1582304) (← links)
- Characteristic decomposition: from regular sets to normal sets (Q1730299) (← 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)
- On the theories of triangular sets (Q1808664) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- An algorithm for isolating the real solutions of semi-algebraic systems (Q1864897) (← links)
- A generalized Euclidean algorithm for geometry theorem proving (Q1924743) (← links)
- Rational general solutions of trivariate rational differential systems (Q1949083) (← links)
- On solving parametric polynomial systems (Q1949089) (← links)
- Algebraic, rational and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one (Q2035619) (← links)
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
- Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- Computing strong regular characteristic pairs with Gröbner bases (Q2229717) (← links)
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds (Q2322361) (← links)
- Generic regular decompositions for generic zero-dimensional systems (Q2335932) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method (Q2439880) (← links)
- Real solution isolation using interval arithmetic (Q2458505) (← links)
- An algorithm for decomposing a polynomial system into normal ascending sets (Q2464308) (← links)
- On approximate triangular decompositions in dimension zero (Q2470055) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials (Q2489188) (← links)
