Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
From MaRDI portal
Publication:3454766
DOI10.1145/345542.345633zbMath1326.68360OpenAlexW2076493281MaRDI QIDQ3454766
Publication date: 26 November 2015
Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/345542.345633
Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15)
Related Items (17)
Real root finding for low rank linear matrices ⋮ On a generalization of Stickelberger's theorem ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ A concise proof of the Kronecker polynomial system solver from scratch ⋮ A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface ⋮ Segre-driven radicality testing ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Complexity of triangular representations of algebraic sets ⋮ Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers ⋮ Solving determinantal systems using homotopy techniques ⋮ Complexity of solving parametric polynomial systems ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ Generators of the ideal of an algebraic space curve ⋮ Effective equidimensional decomposition of affine varieties
This page was built for publication: Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
