The following pages link to (Q4303118):
Displaying 20 items.
- Automatic constructibility checking of a corpus of geometric construction problems (Q294375) (← links)
- On the number of zeros of abelian integral for some Liénard system of type \((4,3)\) (Q400823) (← links)
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification (Q462854) (← links)
- Bounding the number of limit cycles for a polynomial Liénard system by using regular chains (Q507129) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- Properties of regular systems and algorithmic improvements for regular decomposition (Q971615) (← links)
- Computing triangular systems and regular systems (Q1582304) (← 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)
- Recent advances in automated theorem proving on inequalities (Q1966106) (← links)
- A short contribution to the theory of regular chains (Q2035618) (← links)
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- An algorithm for decomposing a polynomial system into normal ascending sets (Q2464308) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- (Q3750118) (← links)
- On the Chordality of Simple Decomposition in Top-Down Style (Q5014670) (← links)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros (Q6087590) (← links)
- Geometry machines: from AI to SMC (Q6560378) (← links)
