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

DOI10.1006/JSCO.1996.0039MaRDI QIDQ677033zbMATH OpenOpenAlexFDO

Authors A. 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)

Recommendations

• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• scientific article; zbMATH DE number 2214061

Cited in

(19)

• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Combinatorial dimension theory of algebraic varieties
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Sparse systems of parameters for determinantal varieties
• On a generalization of Stickelberger's theorem
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• scientific article; zbMATH DE number 4122103 (Why is no real title available?)
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
• The complexity to compute the Euler characteristic of complex varieties
• The Projective Noether Maple Package: Computing the dimension of a projective variety
• On the complexity of Chow and Hurwitz forms
• scientific article; zbMATH DE number 2214061 (Why is no real title available?)
• Complexity of computing the local dimension of a semialgebraic set
• Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
• The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677033)