Determining computational complexity from characteristic ‘phase transitions’

@article{Monasson1999DeterminingCC,
title={Determining computational complexity from characteristic ‘phase transitions’},
author={R{\'e}mi Monasson and Riccardo Zecchina and Scott Kirkpatrick and Bart Selman and Lidror Troyansky},
journal={Nature},
year={1999},
volume={400},
pages={133-137}
}

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… CONTINUE READING