21-801: Random Structures and Algorithms 2021
M,W,F: WEH5320

We will study the typical properties of random combinatorial objects and
the complexity of some associated computational problems.


We will use the book
Introduction to Random Graphs (pdf )

and we will supplement this with material on the average case analysis of algorithms.


Assesment:
Undergraduates: 4 in class tests:
Test 1 Monday, September 20.
Test 2 Monday, October 20
Test 3: Monday, November 8.
Test 4: Last day of classes.

Gradutes: a class presentation of topic from a list that I will select soon.