Time complexity of Sparse Sparse Matrix Multiplication?

[RongqinChen]

trafficstars

Dear authors, Thank you for developing such a great library. I'm writing to ask about the time complexity of the sparse-sparse matrix multiplication implemented in this library. Suppose the sizes of the two sparse matrices are $n \times n$ and the numbers of non-zero elements in them are both $m$.

Best wishes. Ron

[rusty1s]

We are using cusparse internally for SpSpMM, which does not have a open-source implementation available, so I don't know about the time complexity.

[github-actions[bot]]

This issue had no activity for 6 months. It will be closed in 2 weeks unless there is some new activity. Is this issue already resolved?