Table 1 Complexity of the 0–1 ILP problem
From: A novel method for the approximation of multiplierless constant matrix vector multiplication
m=n | Number of variables | Number of constraints | ||||
|---|---|---|---|---|---|---|
r=4 | r=8 | r=16 | ni=m+n | ni=2(m+n) | ni=4(m+n) | |
2 | 36 | 68 | 132 | 11 | 15 | 23 |
4 | 144 | 272 | 528 | 31 | 39 | 55 |
8 | 576 | 1088 | 2112 | 95 | 111 | 143 |
16 | 2304 | 4352 | 8448 | 319 | 351 | 415 |
32 | 9216 | 17,408 | 33,792 | 1151 | 1215 | 1343 |
64 | 36,864 | 69,632 | 135,168 | 4351 | 4479 | 4735 |