The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Complexity of computation on real algebraic numbers
Journal of Symbolic Computation
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Computing the betti numbers of arrangements in practice
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Hi-index | 0.00 |
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi-algebraic descriptions of the semi-algebraically connected components of any given real algebraic or semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincaré characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one.