P soln j1 + j 2  (1  j j 2   (n2) n k3

k  3)! ! (29)

![0_image_0.png](0_image_0.png)

Figure 1: Behavior of  P

from Eq. (28) are

clauses, given by Eq. (10), give good performance as shown in Figure 2. The behavior

k , the balanced clauses force the problem to have two solutions with opposite values. Even

single solution, the algorithm is able to nd solutions for k = 4 with probability of about 1/2, even as n increases.

The discussion of Section 3.2 shows how maximum likelihood estimate for c e can be

$$\mathbf{F}$$
