Expected number of locally maximal solutions for random Boolean CSPs

Abstract : 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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184787
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:59:44 PM
Last modification on : Thursday, January 23, 2020 - 6:22:10 PM
Long-term archiving on: Wednesday, November 18, 2015 - 12:17:15 PM

File

dmAH0108.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184787, version 1

Citation

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. ⟨hal-01184787⟩

Share

Metrics

Record views

658

Files downloads

371