Computing with semi-algebraic sets represented by triangular decomposition
From MaRDI portal
Recommendations
Cited in
(16)- Trinity algebra and its application to machine decompositions
- On the complexity of computing with zero-dimensional triangular sets
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries
- On solving parametric polynomial systems
- The kinetic space of multistationarity in dual phosphorylation
- Computing real radicals and S-radicals of polynomial systems
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Computing cylindrical algebraic decomposition via triangular decomposition
- Computation with semialgebraic sets represented by cylindrical algebraic formulas
- scientific article; zbMATH DE number 1254270 (Why is no real title available?)
- Triangular decomposition of semi-algebraic systems
- Triangular decomposition of semi-algebraic systems
- Nonlinear algebra and applications
- Accelerating parameter synthesis using semi-algebraic constraints
- Testing isomorphism of complex Lie algebras
This page was built for publication: Computing with semi-algebraic sets represented by triangular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254156)