Timeline for Dimension independent computational complexity of singular value decomposition
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Nov 2, 2013 at 17:40 | vote | accept | Janathan | ||
| Nov 1, 2013 at 21:00 | comment | added | Suvrit | I think the complexity will turn out to be something like $O(k\log n \cdot 1/\epsilon)$ but haven't checked yet. | |
| Nov 1, 2013 at 20:56 | history | answered | Suvrit | CC BY-SA 3.0 |