Salman Parsa
Edelsbrunner Group
1 Publication
2014 | Conference Paper | IST-REx-ID: 2177
On the computational complexity of betti numbers reductions from matrix rank
H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.
View
| DOI
H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.
1 Publication
2014 | Conference Paper | IST-REx-ID: 2177
On the computational complexity of betti numbers reductions from matrix rank
H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.
View
| DOI
H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.