|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: 1 subject found.
18.226 Probabilistic Methods in Combinatorics
(
)
Prereq: (18.211, 18.600, and (18.100A, 18.100B, 18.100P, or 18.100Q)) or permission of instructor
Units: 3-0-9
Introduction to the probabilistic method, a fundamental and powerful technique in combinatorics and theoretical computer science. Focuses on methodology as well as combinatorial applications. Suitable for students with strong interest and background in mathematical problem solving. Topics include linearity of expectations, alteration, second moment, Lovasz local lemma, correlation inequalities, Janson inequalities, concentration inequalities, entropy method.
Staff
| ||||||||
