18.218 Probabilistic Method in Combinatorics, Spring 2019
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 posit...
Main Author: | Zhao, Yufei |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Learning Object |
Language: | en-US |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/151192 |
Similar Items
-
Generalized Stationary Points and an Interior Point Method for MPEC
by: Liu, Xinwei, et al.
Published: (2003) -
Developing socially inclusive transportation policy: transferring the United Kingdom policy approach to the State of Victoria?
by: Lucas, K, et al.
Published: (2012) -
Characterizing Scattering by 3-D Arbitrarily Shaped Homogeneous Dielectric Objects Using Fast Multipole Method
by: Li, Jian-Ying, et al.
Published: (2003) -
Gender segregated labor markets and social inequality between occupations
by: Busch, F
Published: (2018) -
International perspectives
by: Lucas, K, et al.
Published: (2011)