34 citations · 53 across the 24 of their papers we have counts for
1 paper · 2 filters
Iskander Aliev
We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in term…