POLYNOMIAL-TIME COMPUTATION OF THE DEGREE OF A DOMINANT MORPHISM IN ZERO CHARACTERISTIC. III

摘要

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 in zero characteristic. Consider a dominant rational morphism from W to W given by homogeneous polynomials of degree d'. We suggest algorithms for constructing objects in general position related to this morphism. These algorithms are deterministic and polynomial in (dd')~n and the size of the input. Bibliography: 13 titles.