Salman Parsa
Edelsbrunner Group
1 Publication
2014 | Conference Paper | IST-REx-ID: 2177
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
View
| DOI
1 Publication
2014 | Conference Paper | IST-REx-ID: 2177
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
View
| DOI