Explore >> Select a destination
|
You are here 
|
andrea.corbellini.name | ||
| | | | |
www.imperialviolet.org
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2021/04/constant-time-big-numbers-introduction/ | |
| | | | |
www.jeremykun.com
|
|
| | | The standard inner product of two vectors has some nice geometric properties. Given two vectors $ x, y \in \mathbb{R}^n$, where by $ x_i$ I mean the $ i$-th coordinate of $ x$, the standard inner product (which I will interchangeably call the dot product) is defined by the formula $$\displaystyle \langle x, y \rangle = x_1 y_1 + \dots + x_n y_n$$ This formula, simple as it is, produces a lot of interesting geometry. | ||
