3 ms·
0/1 ILP is NP-hard and the trivial algorithm takes O(2^N), and it's also in NP.
by tylerhou 3y ago
0/1 ILP is NP-hard and the trivial algorithm takes O(2^N), and it's also in NP.
- adgjlsfhk1 3y agoright, but tfa was about the general case where the fancy new algorithm is log(n)^n