---
res:
bibo_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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Edelsbrunner, Herbert
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
- foaf_Person:
foaf_givenName: Salman
foaf_name: Parsa, Salman
foaf_surname: Parsa
foaf_workInfoHomepage: http://www.librecat.org/personId=4BDBD4F2-F248-11E8-B48F-1D18A9856A87
bibo_doi: 10.1137/1.9781611973402.11
dct_date: 2014^xs_gYear
dct_language: eng
dct_publisher: SIAM@
dct_title: On the computational complexity of betti numbers reductions from matrix
rank@
...