direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

There is no English translation for this web page.

Search for Publication

Search for publications

All Publications

Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets
Citation key BC-Counting-Complexity-Classes-For-Numeric-Computations-Ii-Algebraic-And-Semialgebraic-Sets
Author Peter Bürgisser and Felipe Cucker
Pages 147-191
Year 2006
Journal Journal of Complexity
Volume 22
Number 2
Abstract We define counting classes $\#P_R$ and $\#P_C$ 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 $\mathbb R$, or of systems of polynomial equalities over $\mathbb C$, 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 $\mathbb R$) and algebraic sets (over $\mathbb C$). We prove that the problem to compute the Euler characteristic of semialgebraic sets is $FP_R^R}-complete, and that the problem to compute the geometric degree of complex algebraic sets is $FP_C^C}$-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$ in $N$, the FPSPACE-hardness of the problem of computing the $k$-th 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.
Link to publication Link to original publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.