Counting complexity classes for numeric computations. III: Complex projective sets
In [8] counting complexity classes #P-R and #P-C in the Blum-Shub-Smale (BSS) setting of computations over the real and complex numbers, respectively, were introduced. One of the main results of [8] is that the problem to compute the Euler characteristic of a semialgebraic set is complete in the class FPR#PR. In this paper, we prove that the corresponding result is true over C, namely that the computation of the Euler characteristic of an affine or projective complex variety is complete in the class FPC#PC. We also obtain a corresponding completeness result for the Turing model.
complexity classes euler characteristic counting problems