Pages that link to "Item:Q1264446"
From MaRDI portal
The following pages link to Decomposing polynomial systems into simple systems (Q1264446):
Displaying 38 items.
- Challenging theorem provers with Mathematical Olympiad problems in solid geometry (Q294381) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification (Q462854) (← links)
- A test for monomial containment (Q512370) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- Subsystems of the polynomial system (Q762224) (← links)
- Properties of regular systems and algorithmic improvements for regular decomposition (Q971615) (← links)
- Real zeros of the zero-dimensional parametric piecewise algebraic variety (Q1041521) (← links)
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. (Q1416272) (← links)
- Computing triangular systems and regular systems (Q1582304) (← links)
- Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
- Elimination theory in differential and difference algebra (Q1730314) (← links)
- On the theories of triangular sets (Q1808664) (← 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)
- Parameter identification on abelian integrals to achieve Chebyshev property (Q2033878) (← 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)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- The monotonicity of ratios of some abelian integrals (Q2220332) (← links)
- An algorithm for decomposing a polynomial system into normal ascending sets (Q2464308) (← links)
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials (Q2489188) (← links)
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems (Q2643540) (← links)
- Ordering in solving systems of equations (Q2725987) (← links)
- An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions (Q2799562) (← links)
- Thomas Decomposition of Algebraic and Differential Systems (Q3589061) (← links)
- An algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networks (Q4627647) (← links)
- Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)
- On the Chordality of Simple Decomposition in Top-Down Style (Q5014670) (← links)
- Thomas Decomposition and Nonlinear Control Systems (Q5118404) (← links)
- Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition (Q5175452) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
- On the links between triangular sets and dynamic constructible closure (Q5946465) (← links)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros (Q6087590) (← links)
- Squarefree normal representation of zeros of zero-dimensional polynomial systems (Q6184184) (← links)
- Subresultants of several univariate polynomials in Newton basis (Q6650567) (← links)
- Comprehensive characteristic decomposition of parametric polynomial systems (Q6666527) (← links)
