Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities

Simple item page
dc.creatorBasu, Saugata
dc.date2006-05-18
dc.date.accessioned2026-07-07T07:09:32Z
dc.date.available2026-07-07T07:09:32Z
dc.descriptionWe present an algorithm which takes as input a closed semi-algebraic set, $S \subset \R^k$, defined by \[ P_1 \leq 0, ..., P_\ell \leq 0, P_i \in \R[X_1,...,X_k], °(P_i) \leq 2, \] and computes the Euler-Poincaré characteristic of $S$. The complexity of the algorithm is $k^{O(\ell)}$.
dc.description17 pages, accepted for publication in Computational Complexity
dc.identifierhttps://arxiv.org/abs/cs/0605082
dc.identifierhttp://arxiv.org/abs/cs/0605082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111103
dc.subjectSymbolic Computation
dc.subjectComputational Geometry
dc.titleEfficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
dc.typetext

Files

Collections

arXiv