Mean-field theory for optimization problems
Résumé
A mean-field theory for optimization problems of the Travelling Salesman type, or of the Matching type, is presented. It involves an infinite set of order parameters which measure the lack of self-averageness of the system and its degree of freezing. We further conjecture that NP-completeness is associated with replica symmetry breaking.
Origine : Accord explicite pour ce dépôt
Loading...