/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

kevinventullo.com
| | www.kuniga.me
4.2 parsecs away

Travel
| | NP-Incompleteness:
| | www.bearssl.org
3.2 parsecs away

Travel
| |
| | cp-algorithms.com
4.2 parsecs away

Travel
| | The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.
| | djalil.chafai.net
25.2 parsecs away

Travel
| Let $X$ be an $n\times n$ complex matrix. The eigenvalues $\lambda_1(X), \ldots, \lambda_n(X)$ of $X$ are the roots in $\mathbb{C}$ of its characteristic polynomial. We label them in such a way that $\displaystyle |\lambda_1(X)|\geq\cdots\geq|\lambda_n(X)|$ with growing phases. The spectral radius of $X$ is $\rho(X):=|\lambda_1(X)|$. The singular values $\displaystyle s_1(X)\geq\cdots\geq s_n(X)$ of $X$ are the eigenvalues of the positive semi-definite Hermitian...