Explore >> Select a destination
|
You are here 
|
www.adamconrad.dev | ||
| | | | |
cp-algorithms.com
|
|
| | | | | 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. | |
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: | |
| | | | |
emre.me
|
|
| | | | | A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries). | |
| | | | |
nhigham.com
|
|
| | | For a polynomial $latex \notag \phi(t) = a_kt^k + \cdots + a_1t + a_0, $ where $latex a_k\in\mathbb{C}$ for all $latex k$, the matrix polynomial obtained by evaluating $latex \phi$ at $latex A\in\mathbb{C}^{n \times n}$ is $latex \notag \phi(A) = a_kA^k + \cdots + a_1A + a_0 I. $ (Note that the constant term is... | ||
