Computing the dimension of real algebraic sets
From MaRDI portal
Publication:6666545
DOI10.1145/3452143.3465551MaRDI QIDQ6666545
Mohab Safey El Din, Pierre Lairez
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Voronoi diagram of three lines
- Topological stability of smooth mappings
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Complexity of computing the local dimension of a semialgebraic set
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Sparse FGLM algorithms
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.
- Computing real radicals and \(S\)-radicals of polynomial systems
- On the geometry of polar varieties
- Generalized polar varieties: geometry and algorithms
- Probabilistic algorithm for computing the dimension of real algebraic sets
- Neighborhoods of Algebraic Sets
- Constructing fewer open cells by GCD computation in CAD projection
- Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
- On the discriminant of real symmetric matrices
- Notes on Topological Stability
- Robots, computer algebra and eight connected components
- FGb: A Library for Computing Gröbner Bases
- Triangular decomposition of semi-algebraic systems
- A Gröbner free alternative for polynomial system solving
This page was built for publication: Computing the dimension of real algebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666545)
