Explore >> Select a destination
|
You are here 
|
kevinkle.in | ||
| | | | |
cp4space.hatsya.com
|
|
| | | | | At the end of the recent post on a combinatorial proof of Houston's identity, I ended with the following paragraph: This may seem paradoxical, but there's an analogous situation in fast matrix multiplication: the best known upper bound for the tensor rank of 4-by-4 matrix multiplication is 49, by applying two levels of Strassen's algorithm,... | |
| | | | |
gregorygundersen.com
|
|
| | | | | ||
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
requester.mturk.com
|
|
| | | |||
