Randomized algorithms in combinatorics
Member Seminar Speaker: Michael Simkin Title: Randomized algorithms in combinatorics Abstract: Randomized algorithms have been a computational workhorse for almost as long as there have been computers. Surprisingly, such algorithms can also be used to attack problems that are neither algorithmic nor probabilistic. Time permitting I will discuss the following combintorial examples: Enumerative combinatorics and the […]