Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248)
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 6951774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems |
scientific article; zbMATH DE number 6951774 |
Statements
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (English)
0 references
11 October 2018
0 references
space-efficient algorithms
0 references
\(k\)-sum
0 references
subset sum
0 references
exact exponential time algorithms
0 references
fine-grained complexity
0 references
space-time trade-off
0 references
exponential time algorithms
0 references
0.9923097
0 references
0.95245004
0 references
0.9470212
0 references
0.9397088
0 references
0.9255235
0 references
0.9243406
0 references
0.91714853
0 references
0.9163049
0 references
0.9117423
0 references
