I will describe a general technique for obtaining approximate solutions of hard quadratic optimization problems using economical covers of high dimensional sets by small cubes. The analysis of the method leads to intriguing algorithmic, combinatorial, extremal, geometric and probabilistic questions.
Based on joint work with Lee, Shraibman and Vempala.