Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		emanueleviola.wordpress.com You've seen a black hole, but have you ever seen an expander? - Thoughts
\|	\|	algorithmsoup.wordpress.com The World's Simplest Interesting Algorithm - Algorithm Soup	6.6 parsecs away Travel
\|	\|	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...	6.6 parsecs away Travel
\|	\|	geriatrixfotogallerie.wordpress.com Upholstered chair - Geriatri'x' Fotogallery	4.5 parsecs away Travel
\|	\|	Pull up a seat week 13/2024	4.5 parsecs away Travel
\|	\|	mathematicaloddsandends.wordpress.com A theorem on interpolation error bound \| Mathematical Odds & Ends	5.1 parsecs away Travel
\|	\|	I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex \|f^{(n+1)}(x)\| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates...	5.1 parsecs away Travel
\|	\|	chava61photography.photo.blog Sunday Trees - 450 - This and That: The Continuation	12.8 parsecs away Travel
\|		Visit the post for more.	12.8 parsecs away Travel