|
Zapiski Nauchnykh Seminarov POMI, 2004, Volume 307, Pages 189–235
(Mi znsl845)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Polynomial-time computation of the degree of a dominant morphism in characteristic zero. I
A. L. Chistov St. Petersburg Institute for Informatics and Automation of RAS
Abstract:
Consider a projective algebraic variety $W$ that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than $d$ in $n+1$ variables over a field of zero characteristic. We show how to compute the degree of a dominant rational morphism from $W$ to $W'$ with $\dim W=\dim W'$. The morphism is given by homogeneous polynomials of degree $d'$. This algorithm is deterministic and polynomial in $(dd')^n$ and the size of input.
Received: 25.12.2003
Citation:
A. L. Chistov, “Polynomial-time computation of the degree of a dominant morphism in characteristic zero. I”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part X, Zap. Nauchn. Sem. POMI, 307, POMI, St. Petersburg, 2004, 189–235; J. Math. Sci. (N. Y.), 131:2 (2005), 5547–5568
Linking options:
https://www.mathnet.ru/eng/znsl845 https://www.mathnet.ru/eng/znsl/v307/p189
|
Statistics & downloads: |
Abstract page: | 405 | Full-text PDF : | 69 | References: | 65 |
|