Pages that link to "Item:Q2954983"
From MaRDI portal
The following pages link to Subset sum in the absence of concentration (Q2954983):
Displaying 6 items.
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q5075820) (← links)
- Multifold sumsets and fast decreasing of concentration functions (Q5933628) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)