On the computational complexity of betti numbers reductions from matrix rank

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 152-160

  Edelsbrunner, H ^a   Parsa, S ^a,b  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BETTI NUMBERS; FINITE FIELDS; MATRIX RANK; SIMPLICIAL COMPLEX; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 84902116091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.11     Document Type: Conference Paper

References (18)

1. J. R. Bunch and J. E. Hopcroft. Triangular factorization and inversion by fast matrix multiplication. Math. Comput. 28 (1974), 231-236.
2. D. Cohen-Steiner. H. Edelsbrunner and J. Harer. Extending persistence using Poincare and Lefschetz duality. Found. Comput. Math. 9 (2009), 79-103.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. J. Symbol. Comput. 9 (1990), 251-280.
4. J. A. Delfinado and H. Edelsbrunner. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Comput. Aided Geom. Design 12 (1995), 771-784.
5. T. Dey and Y. Wang. Reeb graphs: Approximation and persistence. Discrete Comput. Geom. 49 (2013) 46-73.
6. H. Doraiswamy and V. Natarajan. Efficient algorithms for constructing Reeb graphs. Comput. Geom. 42 (2009), 606-616.
7. W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann and G. Villard. Faster inversion and other black box matrix computations using efficient block projection. Proc. Intl. Sympos. Symbol. Algeb. Comput., 2007, 143-150.
8. H. Edelsbrunner and J. L. Harer. Computational Topology. An Introduction. Amer. Math. Soc., Providence, Rhode Island, 2010.
9. H. Edelsbrunner, D. Letscher and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511-533.
10. W. Harvey, Y. Wang and R. Wenger. A randomized 0(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes. In "Proc. 26th Ann. Sympos. Comput. Geom.. 2010", 267-276.
11. A. Hatcher. Algebraic Topology. Cambridge Univ. Press, Cambridge, England, 2001.
12. J. Matousek. Using the Borsuk-Ulam Theorem. Springer-Verlag, Berlin, Germany, 2003.
13. S. Parsa. A deterministic 0(m log m) time algorithm for the Reeb graph. Discrete Comput. Geom. 49 (2013), 864-878.
14. D.Wiedemann. Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory 32 (1986), 54- 62.
15. V. V. Williams. Multiplying matrices faster than Coppersmith-Winograd. In "Proc. 44th ACM Sympos. Theory Comput., 2012", 887-898.
16. R. Yuster. Matrix sparsification for rank and determinant computations via nested dissection. In "Proc. 49th Ann. IEEE Sympos. Found. Comput. Sci., 2008", 137- 145.
17. R. Yuster and U. Zwick. Fast sparse matrix multiplication. ACM Trans. Algorithms 1 (2005), 2-13.
18. A. Zomorodian. Topology for Computing. Cambridge Univ. Press, Cambridge, England, 2009.