Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)

DOI10.1007/s10958-011-0282-1zbMath1375.14202OpenAlexW2026707798MaRDI QIDQ389092

Alexander L. Chistov

Publication date: 17 January 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0282-1

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• Strong version of the basic deciding algorithm for the existential theory of real fields
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.

This page was built for publication: Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)