Expected number of locally maximal solutions for random Boolean CSPs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2007

Expected number of locally maximal solutions for random Boolean CSPs

Résumé

For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added. We give the exponential order of the expected number of these distinguished solutions and prove it depends on the sensitivity of the allowed constraint functions only. As a by-product we provide a general tool for computing an upper bound of the satisfiability threshold for any problem of a large class of random Boolean CSPs.
Fichier principal
Vignette du fichier
dmAH0108.pdf (230.55 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184787 , version 1 (17-08-2015)

Identifiants

Citer

Nadia Creignou, Hervé Daudé, Olivier Dubois. Expected number of locally maximal solutions for random Boolean CSPs. 2007 Conference on Analysis of Algorithms, AofA 07, Jun 2007, Juan les Pins, France. pp.109-122, ⟨10.46298/dmtcs.3539⟩. ⟨hal-01184787⟩
552 Consultations
477 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More