4 citations · 6 across the 8 of their papers we have counts for
1 paper · 2 filters
Marco Di Summa
We prove that integer linear feasibility is strongly NP-complete even when the constraint matrix has exactly two nonzero entries in every row and column, with its support forming…