Phase transitions in integer linear problems
Statistical Mechanics
2017-10-11 v1 Disordered Systems and Neural Networks
Computational Complexity
Abstract
The resolution of linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density and the ratio between number of variables and number of constraints . By means of ensemble calculations we show that the space of feasible solutions endows a Van-Der-Waals phase diagram in the plane (, ). We give numerical evidence that the associated computational problems become more difficult across the critical point and in particular in the coexistence region.
Cite
@article{arxiv.1705.06303,
title = {Phase transitions in integer linear problems},
author = {S. Colabrese and D. De Martino and L. Leuzzi and E. Marinari},
journal= {arXiv preprint arXiv:1705.06303},
year = {2017}
}
Comments
15 pages, 6 figures, comments are welcome