Abstract
In [8] counting complexity classes #PR and #PC 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Bürgisser, P., Cucker, F. & Lotz, M. Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found Comput Math 5, 351–387 (2005). https://doi.org/10.1007/s10208-005-0146-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10208-005-0146-x