Traveling sales person problem
Solve problems which are NP hard – and they can’t be solved in polynomial time.
P versus NP problem: full polynomial versus nondeterministic polynomial problem
A P problem is one that can be solved in “polynomial time,” which means that an algorithm exists for its solution such that the number of steps in the algorithm is bounded by a polynomial function of n, where n corresponds to the length of the input for the problem. Thus, P problems are said to be easy, or tractable. A problem is called NP if its solution can be guessed and verified in polynomial time, and nondeterministic means that no particular rule is followed to make the guess.














You must be logged in to post a comment.