Algorithm - NP Complete (Nondeterministic Polynomial Time Complete)

> Code - (Programming|Computer) Language > Algorithm

1 - About

Generally this is a class of problems that are so difficult that even the best solutions cannot consistently determine their solutions in an efficient way. Specifically, NP Complete problems can only possibly be solved in polynomial time using a nondeterministic Turing machine (a computer capable of making guesses and checking them in polynomial time). Problems such as weather prediction, how to fill a box with odd-sized objects, and the Traveling Salesman problem fall into the realm of NP Complete problems. Because of the problem with finding the “best” solution, programs are often developed to find a usually reasonable solution. Take this into account the next time your weatherperson can’t predict the weather–there are just too many variables

Advertising

3 - Reference