On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank
From MaRDI portal
Publication:5383970
DOI10.1137/1.9781611973402.11zbMath1423.55033OpenAlexW4251489240MaRDI QIDQ5383970
No author found.
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.11
Analysis of algorithms and problem complexity (68Q25) General topology of complexes (57Q05) Simplicial sets and complexes in algebraic topology (55U10)
Related Items
Barcodes of towers and a streaming algorithm for persistent homology, Complexity of simplicial homology and independence complexes of chordal graphs, Singular persistent homology with geometrically parallelizable computation