3 ms·
> Scheduling is an NP problem. [...] it takes n^p calculations to schedule it optimally That isn't what NP means. (An O(n^p) algorithm would in fact be in P.)
by duskwuff 2y ago
> Scheduling is an NP problem. [...] it takes n^p calculations to schedule it optimally
That isn't what NP means. (An O(n^p) algorithm would in fact be in P.)
- jmward01 2y agoyep. I wrote without thinking. c^n would be better right.