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		theorydish.blog Average-Case Fine-Grained Hardness, Part I - Theory Dish
\|	\|	lucatrevisan.wordpress.com Online Optimization Post 2: Constructing Pseudorandom Sets \| in theory	6.7 parsecs away Travel
\|	\|	Today we will see how to use the analysis of the multiplicative weights algorithm in order to construct pseudorandom sets. The method will yield constructions that are optimal in terms of the size of the pseudorandom set, but not very efficient, although there is at least one case (getting an ``almost pairwise independent'' pseudorandom generator)...	6.7 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	5.7 parsecs away Travel
\|	\|	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...	5.7 parsecs away Travel
\|	\|	andrew222651.com Uncertainty due to computational approximation in Bayesian inference · Andrew's Blog	5.5 parsecs away Travel
\|	\|		5.5 parsecs away Travel
\|	\|	soatok.blog Asymmetric Cryptographic Commitments - Dhole Moments	30.1 parsecs away Travel
\|		Recently, it occurred to me that there wasn't a good, focused resource that covers commitments in the context of asymmetric cryptography. I had covered confused deputy attacks in my very short (don't look at the scroll bar) blog post on database cryptography., and that's definitely relevant. I had also touched on the subject of commitment...	30.1 parsecs away Travel