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

This publication is cited in the following articles:

1. A. L. Chistov, “A deterministic polynomial-time algorithm for the first Bertini theorem. III”, J. Math. Sci. (N. Y.), 209:6 (2015), 1005–1019    
2. A. L. Chistov, “A deterministic polynomial-time algorithm for the first Bertini theorem. II”, J. Math. Sci. (N. Y.), 200:6 (2014), 769–784    
3. A. L. Chistov, “A deterministic polynomial-time algorithm for the first Bertini theorem. I”, J. Math. Sci. (N. Y.), 196:2 (2014), 223–243      
4. A. L. Chistov, “Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)”, J. Math. Sci. (N. Y.), 174:1 (2011), 71–89