Herbert Edelsbrunner, Salman Parsa. On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pages 152-160, SIAM, 2014. [doi]
Abstract is missing.