Computational complexity of the extended minimum cost homomorphism problem on three-element domains (Q2965524)
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: Computational complexity of the extended minimum cost homomorphism problem on three-element domains |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the extended minimum cost homomorphism problem on three-element domains |
scientific article |
Statements
3 March 2017
0 references
complexity
0 references
optimisation
0 references
constraint satisfaction
0 references
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains (English)
0 references
0.8683881163597107
0 references
0.8466431498527527
0 references
0.8231422305107117
0 references
0.7939871549606323
0 references
0.7882179617881775
0 references
