Combinatorial dimension theory of algebraic varieties

DOI10.1016/S0747-7171(88)80046-4zbMath0697.14001OpenAlexW1996344378MaRDI QIDQ911659

Marc Giusti

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80046-4

zbMATH Keywords

algorithmtime complexityspace complexitydimension of a projective algebraic subset

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Elementary questions in algebraic geometry (14A25)

Related Items

Reconsidering algorithms for real parametric curves, The dimension method in elementary and differential geometry, Equations for the projective closure and effective Nullstellensatz, The membership problem for unmixed polynomial ideals is solvable in single exponential time, Unmixed-dimensional decomposition of a finitely generated perfect differential ideal, The Projective Noether Maple Package: Computing the dimension of a projective variety, On the complexity of the \(F_5\) Gröbner basis algorithm

Cites Work

• A theorem on refining division orders by the reverse lexicographic order
• Computing dimension and independent sets for polynomial ideals
• Résolution des systèmes d'équations algébriques
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Über die Deformation isolierter Singularitäten analytischer Mengen
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item