CSP (Constraint Satisfaction Problem) deg≤d+l deg≤k+l c2 t> c☒ 4 c函 a Boolean at-most-1 variables constraints partition function: ∑ 入川1 i∈{0,1}n satisfying all constraintsCSP (Constraint Satisfaction Problem) Boolean variables deg ≤ d+1 deg ≤ k+1 x1 x2 x3 x4 x5 c1 c2 c3 c4 c5 c6 c7 Z = X ~x2{0,1}n satisfying all constraints ￾k~ xk1 partition function: at-most-1 constraints