Iteration s Clause Samples

Iteration s. Essentially, this proof is identical to Iteration I. We will again apply Algo- rithms 4.3 and 2.7 to further refine the current partition and non-trivially increase the index function. We will limit this proof to an outline. Let s ≥ 2 be an integer, and assume we have constructed, in time O(N 6), the successively refining partitions Π(1), . . . , Π(s), where Π(s) consists of