Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988)
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: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems |
scientific article; zbMATH DE number 6551555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems |
scientific article; zbMATH DE number 6551555 |
Statements
Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (English)
0 references
8 March 2016
0 references
CSP
0 references
constraint satisfaction
0 references
domain reduction
0 references
tractable class
0 references
hybrid tractability
0 references
NP-completeness
0 references
global constraints
0 references
0 references
0 references
0 references
0 references
0 references
0.8651027679443359
0 references
0.8364997506141663
0 references
0.8103657364845276
0 references
0.7960595488548279
0 references
0.75408935546875
0 references
