Presented By: Math Undergraduate Seminar - Department of Mathematics
Probabilistic Methods: Proving Random Facts with Randomness
Luke Miga
Randomness is an unreasonably effective tool in combinatorics and algorithm design. We'll show how a probabilistic approach produces simple proofs of otherwise non-obvious results. For instance, one can find minimum cuts in a graph just by guessing at them.
Explore Similar Events
-
Loading Similar Events...
