The satisfiability problem

Abstract

General framework Surprising as it may be, the emergence of phase transitions is not limited to physical systems: it seems to be a rather ubiquitous phenomenon, existing in biology, genetics, neural networks, complex systems, and also in combinatorial problems. For the last, a precise parallel can be established with physical systems composed of very large numbers of particles. In a combinatorial problem the phase transition concerns the behavior of some order parameter (usually the expectation value of a microscopic quantity) characterizing an aspect of the system (often the probability of existence of a solution). Moreover, in correspondence to the phase transition (at a critical value of the control parameter), a large increase in the computational complexity of the algorithm used to find a solution is usually observed. The key concept that allows ideas and methods to be transferred from statistical physics to combinatorial optimization and decision problems is randomness . If problem instances are taken in isolation, the application of these methods does not make sense. They are only meaningful if applied to a set, i.e., an ensemble , of problem instances whose probability of occurrence is governed by a well defined law. Then the results obtained can be considered valid for any randomly extracted element from the ensemble. It is thus necessary to specify exactly how the elements of the ensemble are constructed.