Delete comment from: Computational Complexity

Sasho said...

Anon2: you are missing the fact that Fix() terminates. If the new assignment to Y un-satisfies X, Y will call Fix() on X. This might look like an infinite recursion, but the proof shows it is not.

This one is definitely from the book. Very beautiful!

Jun 3, 2009, 12:54:33 PM

Posted to A Kolmogorov Complexity Proof of the Lovász Local Lemma