On the complexity of the sequential sampling method

A system of $m$ Boolean equations can be solved by a sequential sampling method using an $m$-step algorithm, where at the $i$-th step the values of all variables essential for the first $i$ equations are sampled and false solutions are rejected based on the right-hand sides parts of the equations, $i=1,\dots,m$. The estimate of the complexity of the method depends on the structure of the sets of essential variables of the equations and attains its minimum after some permutation of the system equations. For the optimal permutation of equations we propose an algorithm that minimizes the average computational complexity of the algorithm under natural probabilistic assumptions. In a number of cases, the construction of such a permutation is computationally difficult; in this connection, other permutations are proposed which are computed in a simpler way but may lead to nonoptimal estimates of the complexity of the method. The results imply conditions under which the sequential sampling method degenerates into the exhaustive search method. An example of constructing an optimal permutation is given. Tab. 2, illustr. 1, biliogr. 11.