Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic

DOI10.1016/S0022-4049(97)00009-1zbMath0893.14020MaRDI QIDQ1358904

Alexander L. Chistov

Publication date: 23 July 1998

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

zbMATH Keywords

real algebraic geometrydimension of algebraic setpolynomial-time computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real-analytic and semi-analytic sets (14P15) Computational aspects of higher-dimensional varieties (14Q15)

Related Items

Straight-line programs in geometric elimination theory, Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero), Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, The complexity of local dimensions for constructible sets, A deterministic polynomial-time algorithm for the first Bertini theorem. II, A deterministic polynomial-time algorithm for the first Bertini theorem. I, A deterministic polynomial-time algorithm for the first Bertini theorem. III, Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV., Complexity of computing the local dimension of a semialgebraic set, Monodromy and irreducibility criteria with algorithmic applications in characteristic zero

Cites Work

• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• Résolution des systèmes d'équations algébriques
• The rationality of a class of tori
• Further Pathologies in Algebraic Geometry
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item