P and NP refer to types of solutions to numerical algorithms. If an algorithm can be solved in "polynomial time" it is referred to as P, if not, it is "non-polynomial time", or NP. Do an internet search for more detail!

P and NP refer to types of solutions to numerical algorithms. If an algorithm can be solved in "polynomial time" it is referred to as P, if not, it is "non-polynomial time", or NP. Do an internet search for more detail!