Subset sum in the absence of concentration (Q2954983)
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 6677384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subset sum in the absence of concentration |
scientific article; zbMATH DE number 6677384 |
Statements
24 January 2017
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.800762951374054
0 references
0.799675703048706
0 references
0.7733944654464722
0 references
