Algorithms and Complexity Seminar: 2013-2014

http://www.ilyaraz.org/acseminar/index1314.html

 Beyond XOR Games: Information causality, Szemerédi-Trotter and Algebraic Variants of CHSH

Approximate Constraint Satisfaction Requires Large LP Relaxations

Approximating matching size from random streams

Approximating Graph Problems: The Old and the New

“Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements”