A Direttissimo Algorithm for Equidimensional Decomposition
From MaRDI portal
Publication:6060379
DOI10.1145/3597066.3597069arXiv2302.08174MaRDI QIDQ6060379
Christian Eder, Unnamed Author, Mohab Safey El Din, Pierre Lairez
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.08174
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for computing triangular decomposition of polynomial systems
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Basic principles of mechanical theorem proving in elementary geometries
- Gröbner bases and primary decomposition of polynomial ideals
- Elimination methods
- A new method for solving algebraic systems of positive dimension
- Direct methods for primary decomposition
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- An elimination method for polynomial systems
- The Magma algebra system. I: The user language
- Effective equidimensional decomposition of affine varieties
- On the theories of triangular sets
- Real solving for positive dimensional systems.
- Prime decompositions of radicals in polynomial rings
- Complete singularity analysis for the perspective-four-point problem
- Computing real radicals and \(S\)-radicals of polynomial systems
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Implementation of prime decomposition of polynomial ideals over small finite fields
- AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES
- Julia: A Fresh Approach to Numerical Computing
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Regular Decompositions
- Dimension-Dependent Upper Bounds for Gröbner Bases
- On the Complexity of Computing Real Radicals of Polynomial Systems
- 3264 Conics in a Second
- Ideals, Varieties, and Algorithms
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
