Solutions of hard knapsack problems using extreme pruning (Q1624979)
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: Solutions of hard knapsack problems using extreme pruning |
scientific article; zbMATH DE number 6985756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solutions of hard knapsack problems using extreme pruning |
scientific article; zbMATH DE number 6985756 |
Statements
Solutions of hard knapsack problems using extreme pruning (English)
0 references
28 November 2018
0 references
knapsack problem
0 references
subset sum problem
0 references
lattice
0 references
LLL reduction
0 references
BKZ reduction
0 references
extreme pruning
0 references
0.8991122
0 references
0.89434016
0 references
0.8915035
0 references
0 references
0.8834464
0 references
0.8824041
0 references
