16 research outputs found
A Simple Model to Generate Hard Satisfiable Instances
In this paper, we try to further demonstrate that the models of random CSP
instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical
interest. Indeed, these models, called RB and RD, present several nice
features. First, it is quite easy to generate random instances of any arity
since no particular structure has to be integrated, or property enforced, in
such instances. Then, the existence of an asymptotic phase transition can be
guaranteed while applying a limited restriction on domain size and on
constraint tightness. In that case, a threshold point can be precisely located
and all instances have the guarantee to be hard at the threshold, i.e., to have
an exponential tree-resolution complexity. Next, a formal analysis shows that
it is possible to generate forced satisfiable instances whose hardness is
similar to unforced satisfiable ones. This analysis is supported by some
representative results taken from an intensive experimentation that we have
carried out, using complete and incomplete search methods.Comment: Proc. of 19th IJCAI, pp.337-342, Edinburgh, Scotland, 2005. For more
information, please click
http://www.nlsde.buaa.edu.cn/~kexu/papers/ijcai05-abstract.ht
Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances
This paper first analyzes the resolution complexity of two random CSP models
(i.e. Model RB/RD) for which we can establish the existence of phase
transitions and identify the threshold points exactly. By encoding CSPs into
CNF formulas, it is proved that almost all instances of Model RB/RD have no
tree-like resolution proofs of less than exponential size. Thus, we not only
introduce new families of CNF formulas hard for resolution, which is a central
task of Proof-Complexity theory, but also propose models with both many hard
instances and exact phase transitions. Then, the implications of such models
are addressed. It is shown both theoretically and experimentally that an
application of Model RB/RD might be in the generation of hard satisfiable
instances, which is not only of practical importance but also related to some
open problems in cryptography such as generating one-way functions.
Subsequently, a further theoretical support for the generation method is shown
by establishing exponential lower bounds on the complexity of solving random
satisfiable and forced satisfiable instances of RB/RD near the threshold.
Finally, conclusions are presented, as well as a detailed comparison of Model
RB/RD with the Hamiltonian cycle problem and random 3-SAT, which, respectively,
exhibit three different kinds of phase transition behavior in NP-complete
problems.Comment: 19 pages, corrected mistakes in Theorems 5 and
Expected number of locally maximal solutions for random Boolean CSPs
International audienceFor a large number of random Boolean constraint satisfaction problems, such as random -SAT, we study how the number of locally maximal solutions evolves when constraints are added. We give the exponential order of the expected number of these distinguished solutions and prove it depends on the sensitivity of the allowed constraint functions only. As a by-product we provide a general tool for computing an upper bound of the satisfiability threshold for any problem of a large class of random Boolean CSPs
Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities
We study how correlations in the random fitness assignment may affect the
structure of fitness landscapes. We consider three classes of fitness models.
The first is a continuous phenotype space in which individuals are
characterized by a large number of continuously varying traits such as size,
weight, color, or concentrations of gene products which directly affect
fitness. The second is a simple model that explicitly describes
genotype-to-phenotype and phenotype-to-fitness maps allowing for neutrality at
both phenotype and fitness levels and resulting in a fitness landscape with
tunable correlation length. The third is a class of models in which particular
combinations of alleles or values of phenotypic characters are "incompatible"
in the sense that the resulting genotypes or phenotypes have reduced (or zero)
fitness. This class of models can be viewed as a generalization of the
canonical Bateson-Dobzhansky-Muller model of speciation. We also demonstrate
that the discrete NK model shares some signature properties of models with high
correlations. Throughout the paper, our focus is on the percolation threshold,
on the number, size and structure of connected clusters, and on the number of
viable genotypes.Comment: 31 pages, 4 figures, 1 tabl