The Complexity of Knapsack in Graph Groups (Q4636653)
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 6862144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Knapsack in Graph Groups |
scientific article; zbMATH DE number 6862144 |
Statements
19 April 2018
0 references
knapsack
0 references
subset sum
0 references
graph groups
0 references
decision problems in group theory
0 references
0.91214967
0 references
0 references
0.8915933
0 references
0.8903428
0 references
0.88834167
0 references
0 references
0 references
