Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties

DOI10.1007/11753728_16MaRDI QIDQ3434689zbMATH OpenOpenAlexFDO

Authors A. L. Chistov

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_16

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• scientific article; zbMATH DE number 177498
• 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
• Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
• The isomorphism problem of projective schemes and related algorithmic problems

This page was built for publication: Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties

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