Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 4:59:44 PM
Last modification on : Saturday, June 25, 2022 - 8:10:35 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:17:15 PM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads