Determining computational complexity from characteristic 'phase transitions'

Abstract

Non-deterministic polynomial time (commonly termed 'NP-complete') problems are relevant to many computational tasks of practical interest - such as the 'travelling salesman problem' - but are difficult to solve: the computing time grows exponentially with problem size in the worst case. It has recently been shown that these problems exhibit 'phase boundaries', across which dramatic changes occur in the computational difficulty and solution character - the problems become easier to solve away from the boundary. Here we report an analytic solution and experimental investigation of the phase transition in K-satisfiability, an archetypal NP-complete problem. Depending on the input parameters, the computing time may grow exponentially or polynomially with problem size; in the former case, we observe a dlscontinuous transition, whereas in the latter case a continuous (second-order) transition is found. The nature of these transitions may explain the differing computational costs, and suggests directions for improving the efficiency of search algorithms. Similar types of transition should occur in other combinatorial problems and in glassy or granular materials, thereby strengthening the link between computational models and properties of physical systems.