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

DOI10.1007/S10958-011-0282-1MaRDI QIDQ389092zbMATH OpenOpenAlexFDO

Authors A. 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) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Computational aspects of higher-dimensional varieties (14Q15)

Recommendations

• Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• An effective construction of a small number of equations defining an algebraic variety
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic

Cites work

• scientific article; zbMATH DE number 3893304 (Why is no real title available?)
• scientific article; zbMATH DE number 2214061 (Why is no real title available?)
• Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• 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
• Strong version of the basic deciding algorithm for the existential theory of real fields

Cited in

(3)

• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• scientific article; zbMATH DE number 5168256 (Why is no real title available?)
• Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties

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

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