A Kolmogorov Complexity Proof of the Lovász Local Lemma

Fortnow, L. (2009). A Kolmogorov Complexity Proof of the Lovász Local Lemma.

Type

Unclassified

Intellectual base

Unclassified

Year

2009

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Incompressibility method
  • Because most members of a finite class have description length near the class logarithm, an incompressible representative is typical; constructing a code from a counterproperty bounds the exceptional set.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ac922092d472 · see in the full table