Dense subset sum may be the hardest (Q4601865)
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 6829354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8221167325973511
0 references
0.821902871131897
0 references
