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

DOI10.1007/S10958-011-0282-1zbMATH Open1375.14202OpenAlexW2026707798MaRDI QIDQ389092FDOQ389092

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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.
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic

Cited In (3)

• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• Title not available (Why is that?)
• 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)