Pages that link to "Item:Q4601865"
From MaRDI portal
The following pages link to Dense Subset Sum may be the hardest (Q4601865):
Displaying 7 items.
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- 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)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)