Explore >> Select a destination
|
You are here 
|
grigory.github.io | ||
| | | | |
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)... | |
| | | | |
ptreview.sublinear.info
|
|
| | | | | ||
| | | | |
jeremykun.com
|
|
| | | | | Hard to believe Sanjeev Arora and his coauthors consider it"a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling."Christos Papadimitriou calls it"so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms inmachine learning, optimization, game theory, | |
| | | | |
jeremykun.wordpress.com
|
|
| | | We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... | ||
