Robust satisfiability for CSPs: hardness and algorithmic results (Q2947586)
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: Robust satisfiability for CSPs: hardness and algorithmic results |
scientific article; zbMATH DE number 6485197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust satisfiability for CSPs: hardness and algorithmic results |
scientific article; zbMATH DE number 6485197 |
Statements
Robust Satisfiability for CSPs (English)
0 references
24 September 2015
0 references
constraint satisfaction problem
0 references
approximation algorithms
0 references
homomorphism duality
0 references
universal algebra
0 references
0.9338326454162598
0 references
0.920059323310852
0 references
0.8287824392318726
0 references
0.8277348875999451
0 references
0.8217371702194214
0 references
