Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study

Asymptotic and finite size parameters for phase transitions : Hamiltonian circuit as a case study

[1]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[2]  Toby Walsh,et al.  Phase Transitions and Annealed Theories: Number Partitioning as a Case Study , 1996, ECAI.

[3]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  A. D. Korshunov,et al.  The main properties of random graphs with a large number of vertices and edges , 1985 .

[5]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[6]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[7]  Toby Walsh,et al.  Scaling Effects in the CSP Phase Transition , 1995, CP.

[8]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

[9]  Toby Walsh,et al.  The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.

[10]  Toby Walsh,et al.  The TSP Phase Transition , 1996, Artif. Intell..

[11]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[12]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[13]  Silvano Martello,et al.  Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph , 1983, TOMS.

[14]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[15]  V. E. Stepanov.  Phase Transitions in Random Graphs , 1970 .