Computing intersection numbers of Chern classes

Let Z⊂Pr be a smooth variety of dimension n and let c0,…,cn be the Chern classes of Z. We present an algorithm to compute the degree of any monomial in {c0,…,cn}. The method is based on intersection theory and may be implemented as a numeric or as a symbolic algorithm.