Explore >> Select a destination
|
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... | |
| | | | |
mkatkov.wordpress.com
|
|
| | | | | For probability space $latex (\Omega, \mathcal{F}, \mathbb{P})$ with $latex A \in \mathcal{F}$ the indicator random variable $latex {\bf 1}_A : \Omega \rightarrow \mathbb{R} = \left\{ \begin{array}{cc} 1, & \omega \in A \\ 0, & \omega \notin A \end{array} \right.$ Than expected value of the indicator variable is the probability of the event $latex \omega \in... | |
| | | | |
junglyhh.wordpress.com
|
|
| | | | | Richard Lipton has an article on mathematical disease. My own definition of mathematical disease is quite similar: it must be simple in form, easily explainable to a non-specialist in a few minutes. Moreover, there should be more than one person exclaiming "how can such a problem be open?". Here I also list some problems I... | |
| | | | |
cambodianbeginnings.wordpress.com
|
|
| | | Visit the post for more. | ||
