Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

DOI10.1016/S0885-064X(03)00031-1zbMath1230.68222MaRDI QIDQ652454

Grégoire Lecerf

Publication date: 14 December 2011

Published in: Journal of Complexity (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99)

Related Items

Effective approximation of the solutions of algebraic equations, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, On the complexity exponent of polynomial system solving, On a generalization of Stickelberger's theorem, A Direttissimo Algorithm for Equidimensional Decomposition, Computing isolated roots of sparse polynomial systems in affine space, A signature-based algorithm for computing the nondegenerate locus of a polynomial system, Directed evaluation, Algorithms for computing triangular decomposition of polynomial systems, A concise proof of the Kronecker polynomial system solver from scratch, Variant quantifier elimination, Segre-driven radicality testing, Computing real radicals and \(S\)-radicals of polynomial systems, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Weak identifiability for differential algebraic systems, Complexity of triangular representations of algebraic sets, Improved dense multivariate polynomial factorization algorithms, On the bit complexity of polynomial system solving, Computing characteristic classes of subschemes of smooth toric varieties, Change of order for regular chains in positive dimension, Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials, Complexity of solving parametric polynomial systems, On sign conditions over real multivariate polynomials, A parametric representation of totally mixed Nash equilibria, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, Efficient Algorithms for Computing Nœther Normalization, A geometric index reduction method for implicit systems of differential algebraic equations, On types of degenerate critical points of real polynomial functions, On computing absolutely irreducible components of algebraic varieties with parameters, Evaluation properties of invariant polynomials, Puiseux Expansions and Nonisolated Points in Algebraic Varieties, Deformation techniques for sparse systems, Evaluation techniques for zero-dimensional primary decomposition, Segre class computation and practical applications, Nœther bases and their applications, Fast computation of a rational point of a variety over a finite field, AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES

Uses Software

• Kronecker
• Magma
• Projective Noether

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• Definability and fast quantifier elimination in algebraically closed fields
• Matrix multiplication via arithmetic progressions
• An improved parallel processor bound in fast matrix inversion
• Complexity of computing the local dimension of a semialgebraic set
• Probabilistic algorithms for geometric elimination
• On the Newton polytope of the resultant
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Lower bounds for diophantine approximations
• The Magma algebra system. I: The user language
• Straight-line programs in geometric elimination theory
• The hardness of polynomial equation solving
• Computing parametric geometric resolutions
• The Projective Noether Maple Package: Computing the dimension of a projective variety
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Effective equidimensional decomposition of affine varieties
• Quadratic Newton iteration for systems with multiplicity
• The computational complexity of the Chow form
• Algebraic Geometry. I: Complex projective varieties.
• On the intrinsic complexity of the arithmetic Nullstellensatz
• On the computational power of pushdown automata
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Computing Chow Forms and Some Applications
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Appendix: The Magma language
• Le rôle des structures de données dans les problèmes d'élimination
• Probabilistic equidimensional decomposition
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Kronecker's and Newton's approaches to solving: a first comparison