Explore >> Select a destination
|
You are here 
|
algorithmsoup.wordpress.com | ||
| | | | |
dominiczypen.wordpress.com
|
|
| | | | | For $latex A, B \subseteq \omega$ we write $latex A \subseteq^* B$ if $latex A\setminus B$ is finite, and we write $latex A\simeq^* B$ if $latex A\subseteq^* B$ and $latex B\subseteq^* A$. A tower is a collection $latex {\cal T}$ of co-infinite subsets of $latex \omega$ such that for all $latex A\neq B\in {\cal T}$... | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | Equations of the form $latex x^3 = y^2 + k$ are called Mordell equations. In this post we're going to prove that the equation $latex x^3 = y^2 -7$ has no integer solutions, using (with one exception) nothing more complicated than congruences. Theorem: There are no integer solutions to the equation $latex x^3 = y^2... | |
| | | | |
rapuran.wordpress.com
|
|
| | | More on Weekly Travel Theme | ||
