Counting complexity classes for numeric computations II : Algebraic and semialgebraic sets

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

27 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)147-191
Journal / PublicationJournal of Complexity
Volume22
Issue number2
Online published13 Dec 2005
Publication statusPublished - Apr 2006

Abstract

We define counting classes #P and #P in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over ℝ, or of systems of polynomial equalities over ℂ, respectively, turn out to be natural complete problems in these classes. We investigate to what extent the new counting classes capture the complexity of computing basic topological invariants of semialgebraic sets (over ℝ) and algebraic sets (over ℂ). We prove that the problem of computing the Euler-Yao characteristic of semialgebraic sets is FP#Pℝ-complete, and that the problem of computing the geometric degree of complex algebraic sets is FPC#PC-complete. We also define new counting complexity classes in the classical Turing model via taking Boolean parts of the classes above, and show that the problems to compute the Euler characteristic and the geometric degree of (semi)algebraic sets given by integer polynomials are complete in these classes. We complement the results in the Turing model by proving, for all k ∈ N, the FPSPACE-hardness of the problem of computing the kth Betti number of the set of real zeros of a given integer polynomial. This holds with respect to the singular homology as well as for the Borel-Moore homology. © 2005 Elsevier Inc. All rights reserved.

Research Area(s)

  • Betti numbers, Counting complexity, Euler characteristic, Geometric degree, Real complexity classes