True to the name of this column, Iâm going to place a wager. I predict that gambling will be broadly legal in the United States by the end of this decade. It will start with online poker, which is currently legal only in Nevada, New Jersey, and Delaware.
Computational complexity theory. Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
P stands for polynomial time. NP stands for non-deterministic polynomial time. Polynomial time means that the complexity of the algorithm is O(n^k), where n is the size of your data (e. g. number of elements in a list to be sorted), and k is a constant. Complexity is time measured in the number of operations it would take, as a function of the number of data items.