In a P problem, the number of step ladder is
bounded by a polynomial based on the input size[Watch the video below]. An unanswered question in math
and computer science is whether or not P = NP. An NP-complete problem means
that is an efficient solution is found, there is an efficient solution to every
other NP problem—but it only works if N=NP. So can you solve this For $1
Million?

**This post was written by Umer Abrar. To contact the author of this post, write to mirzavadoodulbaig@gmail.com or add/follow him on facebook :**