Complexity seminar

A separator theorem for hypergraphs and a CSP-SAT algorithm

I'll show how to remove a small number of edges from a uniform hypergraph of small vertex degree to break it
into small connected components. I'll use it to give a CSP-SAT algorithm for CSPs with small variable frequency.

This is joint work with Vojtěch Rödl.