Timeline for Upper bound on the number of non-zero entries of the product of sparse matrices
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2018 at 14:47 | vote | accept | Morpheus | ||
| Apr 9, 2018 at 0:09 | review | Close votes | |||
| Apr 9, 2018 at 9:25 | |||||
| Apr 8, 2018 at 19:38 | answer | added | Rodrigo de Azevedo | timeline score: 1 | |
| Apr 8, 2018 at 16:54 | comment | added | Igor Rivin | To get sensible bounds you need some structure of the matrices. | |
| Apr 8, 2018 at 13:03 | comment | added | Mahdi - Free Palestine | The product of two sparse matrices can be dense. | |
| S Apr 8, 2018 at 12:42 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor edits
|
| Apr 8, 2018 at 9:52 | review | Suggested edits | |||
| S Apr 8, 2018 at 12:42 | |||||
| Apr 8, 2018 at 0:46 | comment | added | Gerhard Paseman | For many cases that occur in practice, not really. You just need one column of m ones and one row of n ones to generate (potentially) the maximum number of nonzero entries. If the first matrix has a lot of zero rows or the second a lot of zero columns, you can narrow the bound a bit. Gerhard "That's Not Sparse, It's Vacant" Paseman, 2018.04.07. | |
| Apr 8, 2018 at 0:04 | review | First posts | |||
| Apr 8, 2018 at 0:48 | |||||
| Apr 8, 2018 at 0:04 | history | asked | Morpheus | CC BY-SA 3.0 |