The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting locally maximal satisfying assignments of Boolean CSPs |
scientific article |
Statements
The complexity of counting locally maximal satisfying assignments of Boolean CSPs (English)
0 references
18 May 2016
0 references
constraint satisfaction problem
0 references
computational complexity of counting problems
0 references
approximate computation
0 references
0 references
