@inproceedings{2177,
  abstract     = {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.},
  author       = {Edelsbrunner, Herbert and Parsa, Salman},
  booktitle    = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {Portland, USA},
  pages        = {152 -- 160},
  publisher    = {SIAM},
  title        = {{On the computational complexity of betti numbers reductions from matrix rank}},
  doi          = {10.1137/1.9781611973402.11},
  year         = {2014},
}