Pages that link to "Item:Q5895284"
From MaRDI portal
The following pages link to The hardness of solving subset sum with preprocessing (Q5895284):
Displaying 5 items.
- An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces (Q1176382) (← links)
- All binary codes with covering radius one are subnormal (Q1182971) (← links)
- On lengthening of covering codes (Q1199613) (← links)
- On the normality of multiple covering codes (Q1322275) (← links)