On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
From MaRDI portal
Publication:1293345
DOI10.1007/PL00009443zbMath0973.14033MaRDI QIDQ1293345
Publication date: 28 November 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Euler characteristics; real algebraic geometry; semi-algebraic subsets; single exponential time algorithm; sums of Betti numbers
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
14P10: Semialgebraic sets and related spaces
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
Related Items
Pure point spectrum of the Floquet Hamiltonian for the quantum harmonic oscillator under time quasi-periodic perturbations, Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time, Computing the first Betti number of a semi-algebraic set, A sharper estimate on the Betti numbers of sets defined by quadratic inequalities, Homology algorithm based on acyclic subspace, Topological complexity of the relative closure of a semi-Pfaffian couple, Coreduction homology algorithm, Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials, Anderson localization for Schrödinger operators on \(\mathbb{Z}^2\)with quasi-periodic potential, Computing the first few Betti numbers of semi-algebraic sets in single exponential time, Quasi-periodic solutions of nonlinear random Schrödinger equations, On projections of semi-algebraic sets defined by few quadratic inequalities, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, On the Betti numbers of sign conditions
