If you're signaling that you've talked to 1000 capitalist libertarians and 999 of them believe the quoted words, I question your sample.
-
-
succinctly: it is supposed, but not yet proved, that P != NP. where P is the class of problems with optimal algorithmic solution that is polynomial time complexity and NP is the class of problems where proposed solutions can be checked in polynomial time complexity but...
-
...there it is proved that there is no polynomial time complexity algorithm that finds the optimal solution.
-
Tweet unavailable
-
Are you familiar with asymptotic time complexity aka Big-O? That (and maybe the concept of a reduction) are the only challenging concepts required.
- 11 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.