Assignments
Problem Set 1
Description:
Problem set on bipartite graphs, matrix inequalities and lower bounds for λ2, the efficacy of spectral partitioning, proving the Chernoff bound, the existence of bipartite expanders, expander codes, eigenvalues, vertex degrees, indepedent sets, and graph coloring.
Resource Type:
Assignments
pdf
191 kB
Problem Set 1
Course Info
Topics
Learning Resource Types
assignment
Problem Sets
notes
Lecture Notes
