scientific article; zbMATH DE number 806915

zbMath0829.14029MaRDI QIDQ4850731

Marc Giusti, Joos Heintz

Publication date: 22 January 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

isolated pointsdimension of an algebraic varietyeffective affine Nullstellensatz

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15) Relevant commutative algebra (14A05)

Related Items (34)

Effective approximation of the solutions of algebraic equations ⋮ Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic ⋮ Lower bounds for diophantine approximations ⋮ Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study ⋮ Polynomial equation solving by lifting procedures for ramified fibers ⋮ Deformation techniques to solve generalised Pham systems ⋮ Straight-line programs in geometric elimination theory ⋮ Separation bounds for polynomial systems ⋮ Sparse resultants and straight-line programs ⋮ 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 ⋮ Weak identifiability for differential algebraic systems ⋮ Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers ⋮ Rational invariants of a group action. Construction and rewriting ⋮ Computing multihomogeneous resultants using straight-line programs ⋮ The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. ⋮ Deformation techniques for efficient polynomial equation solving. ⋮ The complexity of local dimensions for constructible sets ⋮ Cook's versus Valiant's hypothesis ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ A Gröbner free alternative for polynomial system solving ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ A parametric representation of totally mixed Nash equilibria ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ An algorithm for implicit interpolation ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs ⋮ Complexity of computing the local dimension of a semialgebraic set ⋮ The Projective Noether Maple Package: Computing the dimension of a projective variety ⋮ Functional programming concepts and straight-line programs in computer algebra ⋮ On the complexity of the \(F_5\) Gröbner basis algorithm ⋮ Effective equidimensional decomposition of affine varieties ⋮ Systems of rational polynomial equations have polynomial size approximate zeros on the average

This page was built for publication: