Explore >> Select a destination
|
You are here 
|
0fps.net | ||
| | | | |
www.eigentales.com
|
|
| | | | | The factor graph is a beautiful tool for visualizating complex matrix operations and understanding tensor networks, as well as proving seemingly complicated properties through simple visual proofs. | |
| | | | |
www.jeremykun.com
|
|
| | | | | In this article I'll cover three techniques to compute special types of polynomial products that show up in lattice cryptography and fully homomorphic encryption. Namely, the negacyclic polynomial product, which is the product of two polynomials in the quotient ring $\mathbb{Z}[x] / (x^N + 1)$. As a precursor to the negacyclic product, we'll cover the simpler cyclic product. All of the Python code written for this article is on GitHub. | |
| | | | |
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,... | |
| | | | |
awwalker.com
|
|
| | | Most factorization algorithms in use today fit in one of two camps: sieve-based methods based on congruences of squares, and algorithms based on decompositions of algebraic groups. In this article, we trace the common thread connecting the latter. | ||
