Cited in
(only showing first 100 items - show all)- Chordal networks of polynomial ideals
- Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
- Doing algebraic geometry with the RegularChains library
- Comprehensive Triangular Decomposition
- Computing strong regular characteristic pairs with Gröbner bases
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Computational schemes for subresultant chains
- Thomas decomposition of algebraic and differential systems
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Change of order for regular chains in positive dimension
- Thomas decomposition and nonlinear control systems
- On the mechanization of straightedge and compass constructions
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- Using machine learning to improve cylindrical algebraic decomposition
- Real root isolation of regular chains
- A package for parametric matrix computations
- Algorithms for computing triangular decomposition of polynomial systems
- Algorithms for computing triangular decompositions of polynomial systems
- On the uniqueness problem for quadrature domains
- Truth table invariant cylindrical algebraic decomposition by regular chains
- The Gröbner cover
- Cylindrical algebraic decomposition with equational constraints
- Qualitative investigation of a gene model using computer algebra algorithms
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Complexity of triangular representations of algebraic sets
- MABSys: Modeling and analysis of biological systems
- Algorithmic Thomas decomposition of algebraic and differential systems
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Computing the canonical representation of constructible sets
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- Real quantifier elimination in the RegularChains library
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries
- On approximate linearized triangular decompositions
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Fully incremental cylindrical algebraic decomposition
- On approximate triangular decompositions in dimension zero
- Comprehensive LU Factors of Polynomial Matrices
- Intersection formulas and algorithms for computing triangular decompositions
- Triangular decomposition of semi-algebraic systems
- Solving via modular methods
- Dagwood
- Epsilon
- Ginv
- Kronecker
- Maple
- MetiTarski
- QEPCAD
- REDLOG
- SymbolicData
- OreModules
- Maplet
- modpn
- SqFreeEVAL
- DISCOVERER
- Janet
- SgpDec
- BPAS
- CUMODP
- BLAD
- DifferentialThomas
- DIFFALG
- Paramotopy
- Jets
- IFSGen4LaTeX
- grobcov.lib
- ProjectionCAD
- control.lib
- Wsolve
- primdec
- Metalibm
- LocalizeRingForHomalg
- AlgebraicThomas
- OreMorphisms
- AIDA
- FRISCO
- Indiff
- MABSys
- Phcmaple
- InvolutiveBases
- SDeval
- MapleTA
- NLControl
- OreAlgebraicAnalysis
- ConstructibleSetTools
- ParametricSystemTools
- Audi
- Singularity
- PowerSeries
- BranchCuts
- Theoryguru
- Chordal
- RealCertify
- SolveTools
- Stacks Project
- TDDS
- AlgebraicGeometryTools
This page was built for software: RegularChains
