Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities

DOI10.1145/1060590.1060637zbMath1192.14002OpenAlexW1971195011MaRDI QIDQ3581396

Saugata Basu

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060637

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)

Related Items (1)

Algebraic cycles from a computational point of view

This page was built for publication: Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities