On the complexity of finding and counting solution-free sets of integers (Q1752464)
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 6872393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding and counting solution-free sets of integers |
scientific article; zbMATH DE number 6872393 |
Statements
On the complexity of finding and counting solution-free sets of integers (English)
0 references
24 May 2018
0 references
parameterised complexity
0 references
solution-free sets
0 references
0 references
0.8822550177574158
0 references
0.8644580841064453
0 references
0.8563602566719055
0 references
0.8262637257575989
0 references
0.7739623785018921
0 references
