Explore >> Select a destination
|
You are here 
|
dominiczypen.wordpress.com | ||
| | | | |
thehighergeometer.wordpress.com
|
|
| | | | | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... | |
| | | | |
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... | |
| | | | |
cuoichutdi.wordpress.com
|
|
| | | | | L?t l?i m?t s? trang mà l?u t? h?i x?a nh?ng ch?a có d?p ??c https://burttotaro.wordpress.com/2010/10/19/books-for-beginning-research/ Google tìm ki?m thì mình th?y m?t topic khá thú v? | |
| | | | |
greatmusclemasstips.wordpress.com
|
|
| | | This is your very first post. Click the Edit link to modify or delete it, or start a new post. If you like, use this post to tell readers why you started this blog and what you plan to do with it. Happy blogging! | ||
