Dense Subset Sum may be the hardest (Q4601865)
From MaRDI portal
scientific article; zbMATH DE number 6829354
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dense Subset Sum may be the hardest |
scientific article; zbMATH DE number 6829354 |
Statements
24 January 2018
0 references
subset sum
0 references
additive combinatorics
0 references
exponential-time algorithm
0 references
homomorphic hashing
0 references
Littlewood-Offord problem
0 references
cs.DS
0 references
cs.CC
0 references
cs.DM
0 references
cs.IT
0 references
math.IT
0 references
