Timeline for How hard (P, NP, NP-hard) is it to compute Schur norms of matrices (as multipliers)?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2014 at 23:38 | answer | added | Nathaniel Johnston | timeline score: 14 | |
| Oct 27, 2013 at 0:38 | answer | added | Suvrit | timeline score: 3 | |
| Oct 26, 2013 at 15:40 | comment | added | Suvrit | See e.g., by the following paper: math.uwaterloo.ca/~krdavids/Preprints/DavDon_schur.pdf which says that calculation of this norm is often even "impossible"! | |
| Oct 26, 2013 at 4:10 | comment | added | Suvrit | I think it can be NP-Hard; I'll see if I can locate a more precise statement (on a side note: what would it mean for this problem to be in NP, could you make that precise?) | |
| Oct 26, 2013 at 3:29 | comment | added | Michael | Wouldn't $||T||_{Shur}$ be just $max_{i,j}(t_{ij})$? | |
| Oct 26, 2013 at 3:08 | history | asked | Alin Galatan | CC BY-SA 3.0 |