The complexity of Boolean constraint satisfaction local search problems (Q1777392)
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 Boolean constraint satisfaction local search problems |
scientific article; zbMATH DE number 2168183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of Boolean constraint satisfaction local search problems |
scientific article; zbMATH DE number 2168183 |
Statements
The complexity of Boolean constraint satisfaction local search problems (English)
0 references
13 May 2005
0 references
satisfiability
0 references
local search
0 references
complexity
0 references
optimization
0 references
PLS
0 references
PLS-complete
0 references
0.8171731233596802
0 references
0.7907237410545349
0 references
0.7859829664230347
0 references
0.7819485068321228
0 references
