The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of counting locally maximal satisfying assignments of Boolean CSPs |
scientific article; zbMATH DE number 6581634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of counting locally maximal satisfying assignments of Boolean CSPs |
scientific article; zbMATH DE number 6581634 |
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
0.9125012
0 references
0.89622724
0 references
0.89622724
0 references
0.8938811
0 references
0.89100933
0 references
0.88723373
0 references
0 references
0 references
0.8831432
0 references
