DOAJ Open Access 2007

Expected number of locally maximal solutions for random Boolean CSPs

Nadia Creignou Hervé Daudé Olivier Dubois

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (3)

Nadia Creignou

Hervé Daudé

Olivier Dubois

Format Sitasi

APA MLA BibTeX

Creignou, N., Daudé, H., Dubois, O. (2007). Expected number of locally maximal solutions for random Boolean CSPs. https://doi.org/10.46298/dmtcs.3539

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3539

Informasi Jurnal

Tahun Terbit: 2007
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3539
Akses: Open Access ✓