Video Lectures

Separate tags with a comma.

The Unique-Games Conjecture is a central open problem in the field of PCP’s (Probabilistically Checkable Proofs) and hardness of approximation, implying tight inapproximability results for wide class of optimization problems.

We will discuss PCPs...

For a family of graphs F, a graph G is F-universal if G contains every graph in F as a (not necessarily induced) subgraph. A natural candidate to serve as universal graph G is the random graph G(n,p). In this case, we want to find an optimal p for...

The Zilber-Pink conjecture is a far reaching finiteness conjecture in diophantine geometry, unifying and extending Mordell-Lang and Andre-Oort. This lecture will state the conjecture, illustrate its varied faces, and indicate how the point-counting...