We consider a random constraint satisfaction problem named model RB, which exhibits a
sharp satisfiability phase-transition phenomenon when the control parameters pass through …

Constraints satisfaction problem (CSP) is a family of computation problems that are
generally hard to solve in the worst case, which motivates the study of average cases by …

The standard models used to generate random binary constraint satisfaction problems are
described. At the problem sizes studied experimentally, a phase transition is seen as the …

The study of phase transition phenomenon of NP complete problems plays an important role
in understanding the nature of hard problems. In this paper, we follow this line of research by …

In this paper we propose a new type of random CSP model, called Model RB, which is a
revision to the standard Model B. It is proved that phase transitions from a region where …

The model k k-CSP is a random CSP model with moderately growing arity kk of constraints.
By incorporating certain linear structure, k k-CSP is revised to a random linear CSP, named …

In this paper, we study the relation among the parameters in their most general setting that
define a large class of random CSP models dk-CSP where d is the domain size and k is the …

In this paper, we show that the models of random CSP instances proposed by Xu and Li [K.
Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of …

This paper analyzes the resolution complexity of two random constraint satisfaction problem
(CSP) models (ie Model RB/RD) for which we can establish the existence of phase …

We study threshold properties of random constraint satisfaction problems under a
probabilistic model due to Molloy [Models for random constraint satisfaction problems, in …