(i) Consider an instance of K-SAT in which each clause overlaps (has a variable in common, regardless of the negation symbol) with at most D others. Lovasz showed that when eD ≤ 2^K (regardless of the number of variables) the conjunction of the clauses was satisfiable. The new approach due to Moser is to start with a random true-false assignment. In a WHILE loop, if any clause is not satisfied we "fix it" by a random reassignment. The analysis of the algorithm (due to Don Knuth and others) is unusual, connecting the running of the algorithm with certain Tetris patterns, and leading to some algebraic combinatorics. [These results apply in a quite general setting with underlying independent "coin flips" and bad events (the clause not being satisfied) that depend on only a few of the coin flips.]
(ii) No Outliers. Given n vectors r_j in n-space with all coefficients in [-1,+1] one wants a vector X=(x_1,...,x_n) with all x_i=+1 or -1 so that all dot products (X dot r_j) are at most K sqrt(n) in absolute value, K an absolute constant. A random X would make (X dot r_j) Gaussian but there would be outliers. The existence of such an X was first shown by the speaker. The new approach, due to Lovett and Meka, is to begin with X=(0,...,0) and let it float in kind of restricted Brownian Motion until all the coordinates hit the boundary.
Back to the ACO home page