Explore >> Select a destination
|
You are here 
|
swethatanamala.github.io | ||
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
www.jeremykun.com
|
|
| | | | | Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$ vertices for which all edges are red. There is a blue $ m$-clique. It is known that these numbers are always finite, but it is very difficult to compute them exactly. | |
| | | | |
www.adamconrad.dev
|
|
| | | | | Follow along with Steven Skiena's Fall 2018 algorithm course applied to the JavaScript language. | |
| | | | |
darkrpgs.home.blog
|
|
| | | Look Outside is a huge surprise: a dark JRPG with a killing art style, challenging, and full of secrets. The player wanders entirely in one apartment building since something outside is horribly mutating people. You have only 15 days to explore, gather supplies, and discover what is happening. And with 100+ grotesque monsters and disturbing... | ||
