The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
On the random satisfiable process
[article]
2008
arXiv
pre-print
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas -- randomly permute all 2^knk possible clauses over the variables x_1, ..., x_n, and starting from the empty formula, go over the clauses one by one, including each new clause as you go along if after its addition the formula remains satisfiable. We study the evolution of this process, namely the distribution over formulas obtained after scanning through the first m clauses (in the
arXiv:0807.4326v1
fatcat:wua6zgqm6fdydgki2kwd4aauz4