Abstract
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions involved in the search results in analogy with quantities in statistical physics, we indicate how the onset of a computationally hard regime can be detected and the transit to higher quality solutions be quantified by an appropriate response function. The existence of a dynamical critical exponent is shown, enabling one to predict the onset of critical slowing down, rather than finding it after the event, in the specific case of a travelling salesman problem (TSP). This can be used as a means of improving efficiency and speed in searches, and avoiding needless computations.
Similar content being viewed by others
References
S Kirkpatrick, C D Gelatt and M P Vecchi, Science 220, 671 (1983)
M Mezard and G Parisi, J. Phys. 47, 1285 (1986)
M Mezard and G Parisi, Europhys. Lett. 2, 913 (1986)
Y Fu and P W Anderson, J. Phys. A19, 1605 (1986)
T Hogg and B A Huberman, Phys. Rep. 156, 227 (1987)
W Krauth and M Mezard, Europhys. Lett. 8, 213 (1989)
S Kirkpatrick and B Selman, Science 264, 1297 (1994)
T A Hogg, B A Huberman and C P Williams, Artif. Intell. 81, 1 (1996)
R Monasson and R Zecchina, Phys. Rev. E 56, 1357 (1997)
R Monasson, R Zecchina, S Kirkpatrick, B Selman and L Troyansky, Nature (London) 400, 133 (1999)
A K Hartmann and M Weigt, Phase transitions in combinatorial optimization problems (Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, 2005)
S Zilberstein, AI Magazine 17, 73 (1996)
E A Hansen and S Zilberstein, Proc. of the 13th Natl. Conf. on Artificial Intelligence (AAAI, Portland, Oregon, 1996)
H A Kramers, Commun. K. O. Lab. 22Suppl. 83 1 (1936)
I P Gent and T Walsh, Artif. Intell. 88, 349 (1996)
H E Stanley, Introduction to phase transitions and critical phenomena (Oxford University Press Inc., New York, 1971)
F Baras, G Nicolis, M Malek Mansour and J W Turner, J. Stat. Phys. 32, 1 (1983)
N Goldenfeld, Lectures on phase transitions and the renormalization group (Addison Wesley Publishing Company, Reading, Mass., 1992)
P M Chaikin and T C Lubensky, Principles of condensed matter physics (Cambridge University Press, New Delhi, 1998)
D I Dykman and M A Krivoglaz, Physica A104, 480 (1980)
J Beardwood, J H Halton and J M Hammersley, Proc. Cambridge Philos. Soc. 55, 299 (1959)
A G Percus and O C Martin, Phys. Rev. Lett. 76, 1188 (1996)
M Y Choi and J Lee, Phys. Rev. E50, R651 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ashok, B., Patra, T.K. Locating phase transitions in computationally hard problems. Pramana - J Phys 75, 549–563 (2010). https://doi.org/10.1007/s12043-010-0138-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12043-010-0138-0