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 |
---|---|
Language: | en-US |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/151192 |
Similar Items
-
A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results—A Survey
by: András Faragó
Published: (2021-12-01) -
A nonhomogeneous Schrödinger equation involving nonlinearity with exponential critical growth and potential which can vanish at infinity
by: Yony Raúl Santaria Leuyacc
Published: (2023-02-01) -
Existence and multiplicity of solutions for a singular semilinear elliptic problem in R^2
by: Manasses de Souza
Published: (2011-08-01) -
A class of Schrödinger elliptic equations involving supercritical exponential growth
by: Yony Raúl Santaria Leuyacc
Published: (2023-04-01) -
On the application of strong approximation to weak convergence of products of sums for dependent random variables
by: P.Matuła, et al.
Published: (2008-12-01)