Robust algorithms with polynomial loss for near-unanimity CSPs (Q5203794)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7141256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust algorithms with polynomial loss for near-unanimity CSPs |
scientific article; zbMATH DE number 7141256 |
Statements
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (English)
0 references
9 December 2019
0 references
constraint satisfaction
0 references
approximation algorithms
0 references
robust algorithm
0 references
near-unanimity polymorphism
0 references
0 references
0 references
0 references
0.997147798538208
0 references
0.8287824392318726
0 references
0.8142525553703308
0 references
0.8111379742622375
0 references
0.7984812259674072
0 references
