Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic

DOI10.1006/jsco.1996.0039zbMath0889.14027OpenAlexW2078784252MaRDI QIDQ677033

Alexander L. Chistov

Publication date: 23 June 1998

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

Full work available at URL: https://semanticscholar.org/paper/7ff7598b6813dd83f30c6c72991ba4d9da958983

zbMATH Keywords

homogeneous polynomialsdimension of a projective algebraic varietytime of the algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15)

Related Items (5)

Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic ⋮ 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 real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. ⋮ Complexity of computing the local dimension of a semialgebraic set

This page was built for publication: Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic