✦ LIBER ✦

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. III

✍ Scribed by A. L. Chistov

Book ID: 106434923
Publisher: Springer US
Year: 2007
Tongue: English
Weight: 326 KB
Volume: 147
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-007-0540-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time computation of the degre

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. II

✍ A. L. Chistov 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 675 KB

Polynomial-Time Computation of the Degre

Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I

✍ A. L. Chistov 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 712 KB

Polynomial-time computation of the degre

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV

✍ A. L. Chistov 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 379 KB

Polynomial-Time Computation of the Degre

Polynomial-Time Computation of the Degree of Algebraic Varieties in Zero Characteristic and Its Applications

✍ A. L. Chistov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 473 KB

Polynomial-Time Computation of the Dimen

Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic

✍ ALEXANDER L. CHISTOV 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 772 KB

In this paper an algorithm is described for the computation of the dimension of a projective algebraic variety over a zero characteristic ground field. The variety is given as a set of zeros of a family of homogeneous polynomials of the degree less than d in n + 1 variables. The working time of the

Polynomial-time algorithms for a new mod

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

✍ A. L. Chistov 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 800 KB