You are here |
nickhar.wordpress.com | ||
| | | |
algorithmsoup.wordpress.com
|
|
| | | | In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... | |
| | | |
mikespivey.wordpress.com
|
|
| | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | |
mkatkov.wordpress.com
|
|
| | | | Edit 6.6.2016. Premature optimization is a source for errors. The following is completely wrong. Would like to smoke the same thing again. Linear algebra does not work here. We need characterization of quotient space. What I do not understand is why fast methods are working modulo number itself, but not other prime numbers. Suppose we... | |
| | | |
boomet.home.blog
|
|
| | Clouds over the Delaware River The wind whispers, stormsover river dreams, the river seemsawake and wild, shimmering-riledby ancient breath or humming moon. The wind whispers, storms-too soon the blue, the hueof water-sky. So high the ospreys flythrough shifting clouds, the rustling loud as the wind whispers, storms,through trees, bent but proud.The squirrels chitter, the deer... |