Entropy-Weighted Soundness for Multi-Answer Birthday GraphsResearch Paper
A collection of small partial assignments can encode a complete satisfying assignment: retain every restriction of that assignment to a fixed number of coordinates. The converse question asks whether a comparably large collection of local assignments can be densely compatible when no global assignment satisfies most constraints. This question concerns the De…