Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592)
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: Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms |
scientific article; zbMATH DE number 7418620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms |
scientific article; zbMATH DE number 7418620 |
Statements
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (English)
0 references
2 November 2021
0 references
constraint satisfaction problems
0 references
infinite domains
0 references
partition schemes
0 references
lower bounds
0 references
0 references
0 references
0.8620123863220215
0 references
0.75254887342453
0 references
0.7489168047904968
0 references
0.7479841113090515
0 references
0.7380619645118713
0 references
