TY - CONF
AB - We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity.
AU - Edelsbrunner, Herbert
AU - Parsa, Salman
ID - 2177
T2 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
TI - On the computational complexity of betti numbers reductions from matrix rank
ER -