Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with matrices
Search options questions only
not deleted
user 344
24
votes
1
answer
3k
views
Space complexity of Coppersmith–Winograd algorithm
Coppersmith–Winograd algorithm is the asymptotically fastest known algorithm for multiplying two $n \times n$ square matrices. …
- 10.6k
4
votes
0
answers
117
views
Approximating Front Size of Asymmetric Matrices
I am wondering if there is an earlier approximation algorithm for front size of asymmetric matrices. … Is there an approximation algorithm for the front size of asymmetric matrices, prior to our work ? …
- 10.6k