Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> 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.)



yep. I wrote without thinking. c^n would be better right.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: