Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11
LibreCat: https://research-explorer.ista.ac.at/record/2177
DOI: 10.1137/1.9781611973402.11