Details:
Title  Computing intersection numbers of Chern classes  Author(s)  Daniel J. Bates, David Eklund, Chris Peterson  Type  Article in Journal  Abstract  Let Z ⊂ P^r be a smooth variety of dimension n and let c^0 , … , c^n be the Chern classes of Z. We present an algorithm to compute the degree of any monomial in c^0 , … , c^n . The method is based on intersection theory and may be implemented as a numeric or as a symbolic algorithm.  Keywords  Homotopy continuation, Numerical algebraic geometry, Polynomial system, Linkage  ISSN  07477171 
URL 
http://www.sciencedirect.com/science/article/pii/S0747717112001587 
Language  English  Journal  Journal of Symbolic Computation  Volume  50  Number  0  Pages  493  507  Year  2013  Edition  0  Translation 
No  Refereed 
No 
