scientific article; zbMATH DE number 2214061

MaRDI QIDQ5695533zbMATH OpenFDO

Authors A. L. Chistov

Publication date 13 October 2005

Full work available at URL https://eudml.org/doc/229626, http://www.pdmi.ras.ru/znsl/2005/v325.html

Mathematics Subject Classification ID

Rational and birational maps (14E05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Recommendations

• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• 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
• A deterministic polynomial-time algorithm for the first Bertini theorem. II

Cited in

(10)

• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• Polynomial-time algorithms for a new model of representation of algebraic varieties (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.
• Bounded birationality and isomorphism problems are computable
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• A deterministic polynomial-time algorithm for the first Bertini theorem. I
• A deterministic polynomial-time algorithm for the first Bertini theorem. III

This page was built for publication:

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