| Rewrite problem |
|
|
|
|
|
|
|
|
|
|
|
| l | Assume p=1/2 |
|||||||||
| » | Count satisfying
assignments |
|||||||||
| l | “Satisfaction
matrix |
|||||||||
| » | Truth table with
one column per clause |
|||||||||
| » | Sij=1 if ith assignment satisfies jth clause |
|||||||||
| l | We want number of
nonzero rows |
|||||||||
