Parameterized algorithms for constraint satisfaction problems above average with global cardinality constraints (Q4575760)
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 6904051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for constraint satisfaction problems above average with global cardinality constraints |
scientific article; zbMATH DE number 6904051 |
Statements
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints (English)
0 references
16 July 2018
0 references
0.843867838382721
0 references
0.8311868906021118
0 references
0.8125739693641663
0 references
0.7823922038078308
0 references
0.780787467956543
0 references
