| dc.contributor.author | Zhao, Yufei | |
| dc.date.accessioned | 2024-10-16T19:57:34Z | |
| dc.date.available | 2024-10-16T19:57:34Z | |
| dc.date.issued | 2020 | |
| dc.identifier.other | 18.226-Fall2020 | |
| dc.identifier.other | 18.226 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/157369 | |
| dc.description.abstract | This course is a graduate-level introduction to the probabilistic method, a fundamental and powerful technique in combinatorics and theoretical computer science. The essence of the approach is to show that some combinatorial object exists and prove that a certain random construction works with positive probability. The course focuses on methodology as well as combinatorial applications.
This course was previously numbered 18.218. | en_US |
| dc.language.iso | en | en_US |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Mathematics - Discrete Mathematics | en_US |
| dc.subject | Mathematics - Probability and Statistics | en_US |
| dc.subject | Lecture Notes | en_US |
| dc.subject | Problem Sets | en_US |
| dc.subject | Instructor Insights | en_US |
| dc.title | 18.226 Probabilistic Method in Combinatorics, Fall 2020 | en_US |
| dc.type | Learning Object | en_US |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
