Abstract

. We consider pre-processing a random instance I of CNF Satisfiability in order to remove infrequent variables (those which appear once or twice in an instance) from I. The model used to generate random instances is the popular random-clause-size model with parametersn, the number of clauses, r, the number of Boolean variables from which clauses are composed, and p, the probability that a variable appears in a clause as a positive (or negative) literal. It is shown that exhaustive search over such pre-processed instances runs in polynomial average time over a significantly larger parameter space than has been shown for any other algorithm under the random-clause-size model when n = r ffl , ffl ! 1, and pr ! p fflr ln(r). Specifically, the results are that random instances of Satisfiability are "easy" in the average case if n = r ffl , 2=3 ? ffl ? 0, and pr ! (ln(n)=4) 1=3 r 2=3\Gammaffl ; or n = r ffl , 1 ? ffl 2=3, pr ! (1 \Gamma ffl \Gamma ffi) ln(n)=ffl for any ffi ? 0...

Citations

44	The Analysis of Algorithms - Purdom, Brown - 1985
26	CNF satisfiability test by counting and polynomial average time - Iwama - 1989
26	The pure literal rule and polynomial average time - Purdom, Brown
21	On the probabilistic performance of algorithms for the Satisfiability problem - Franco - 1986
11	Exponential average time for the pure literal rule - Bugrara, Pan, et al. - 1989
3	Polynomial average time Satisfiability problems - Purdom, Brown - 1987