Effective equidimensional decomposition of affine varieties

DOI10.1016/S0022-4049(01)00083-4zbMath1055.14061MaRDI QIDQ1602652

Gabriela Jeronimo, Juan Sabia

Publication date: 24 June 2002

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

probabilistic algorithmequidimensional components

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Effective approximation of the solutions of algebraic equations, Degree bound for toric envelope of a linear algebraic group, On the complexity exponent of polynomial system solving, On a generalization of Stickelberger's theorem, A Direttissimo Algorithm for Equidimensional Decomposition, A signature-based algorithm for computing the nondegenerate locus of a polynomial system, A concise proof of the Kronecker polynomial system solver from scratch, Segre-driven radicality testing, Complexity of triangular representations of algebraic sets, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Random arithmetic formulas can be reconstructed efficiently, Complexity of solving parametric polynomial systems, A parametric representation of totally mixed Nash equilibria, On computing absolutely irreducible components of algebraic varieties with parameters, Puiseux Expansions and Nonisolated Points in Algebraic Varieties, Bit complexity for computing one point in each connected component of a smooth real algebraic set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability and fast quantifier elimination in algebraically closed fields
• Straight-line programs in geometric elimination theory
• Sharp estimates for the arithmetic Nullstellensatz
• Bounds of traces in complete intersections and degrees in the Nullstellensatz
• On the efficiency of effective Nullstellensätze
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Probabilistic equidimensional decomposition