Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
From MaRDI portal
Publication:1358904
DOI10.1016/S0022-4049(97)00009-1zbMath0893.14020MaRDI QIDQ1358904
Publication date: 23 July 1998
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Real-analytic and semi-analytic sets (14P15) Computational aspects of higher-dimensional varieties (14Q15)
Related Items (13)
Unnamed Item ⋮ Straight-line programs in geometric elimination theory ⋮ On a generalization of Stickelberger's theorem ⋮ 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 ⋮ Solving degenerate sparse polynomial systems faster ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
