The following pages link to RegularChains (Q13544):
Displaying 50 items.
- Computing the canonical representation of constructible sets (Q294390) (← links)
- Model reduction of chemical reaction systems using elimination (Q359898) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- Formal algorithmic elimination for PDEs (Q468363) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← 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)
- Computational schemes for subresultant chains (Q831961) (← links)
- Algebraic transformation of differential characteristic decompositions from one ranking to another (Q1008569) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets (Q1701473) (← links)
- What does ``without loss of generality'' mean, and how do we detect it (Q1701639) (← links)
- Open weak CAD and its applications (Q1711996) (← links)
- Complexity of triangular representations of algebraic sets (Q1714872) (← links)
- On the mechanization of straightedge and compass constructions (Q1730306) (← links)
- The Gröbner cover (Q1755631) (← links)
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries (Q1940931) (← links)
- Algebraic and symbolic computation methods in dynamical systems. Based on articles written for the invited sessions of the 5th symposium on system structure and control, IFAC, Grenoble, France, February 4--6, 2013 and of the 21st international symposium o (Q1986483) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Subresultant chains using Bézout matrices (Q2109975) (← links)
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis (Q2109991) (← links)
- On parametric linear system solving (Q2110215) (← links)
- Computing strong regular characteristic pairs with Gröbner bases (Q2229717) (← links)
- On the uniqueness problem for quadrature domains (Q2231566) (← links)
- Dynamics of a density-dependent stage-structured predator-prey system with Beddington-DeAngelis functional response (Q2257554) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition (Q2287902) (← links)
- Computing images of polynomial maps (Q2305553) (← links)
- Fully incremental cylindrical algebraic decomposition (Q2307621) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Study of \(D\)-decompositions by the methods of computational real-valued algebraic geometry (Q2393036) (← links)
- Discovering polynomial Lyapunov functions for continuous dynamical systems (Q2437283) (← links)
- On approximate triangular decompositions in dimension zero (Q2470055) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- Mathematical software -- ICMS 2014. 4th international congress, Seoul, South Korea, August 5--9, 2014. Proceedings (Q2512544) (← links)
- Qualitative investigation of a gene model using computer algebra algorithms (Q2629399) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
- Real Root Isolation of Regular Chains (Q2799549) (← links)
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (Q2829999) (← links)
- Recognition of concurrency relations between inaccurate lines (Q2855784) (← links)
- Real Quantifier Elimination in the RegularChains Library (Q2879136) (← links)
- Cylindrical Algebraic Decomposition in the RegularChains Library (Q2879157) (← links)
