6 papers:
STOC-2005-Basu #algebra #algorithm #polynomial #set- Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities (SB), pp. 313–322.
- STOC-2005-BasuPR #algebra #component #set
- Computing the first Betti number and the connected components of semi-algebraic sets (SB, RP, MFR), pp. 304–312.
- STOC-2002-Bas
- Computing the betti numbers of arrangements (SB), pp. 712–720.
- STOC-1996-Basu #algebra #bound #on the #set
- On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets (SB), pp. 408–417.
- STOC-1996-Friedman #combinator
- Computing Betti Numbers via Combinatorial Laplacians (JF), pp. 386–391.
- STOC-1994-Yao #complexity
- Decision tree complexity and Betti numbers (ACCY), pp. 615–624.
