/explore
|
You are here 
|
nickhar.wordpress.com | ||
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | 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)... | |
| | | | |
junglyhh.wordpress.com
|
|
| | | | | Richard Lipton has an article on mathematical disease. My own definition of mathematical disease is quite similar: it must be simple in form, easily explainable to a non-specialist in a few minutes. Moreover, there should be more than one person exclaiming "how can such a problem be open?". Here I also list some problems I... | |
| | | | |
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... | |
| | | | |
bartoszmilewski.com
|
|
| | | This is part 12 of Categories for Programmers. Previously: Declarative Programming. See the Table of Contents. It seems like in category theory everything is related to everything and everything can be viewed from many angles. Take for instance the universal construction of the product. Now that we know more about functors and natural transformations, can... | ||
