Verified answer

At present, no one knows the answer to this question, because no one has ever proved that there are any problems in NP that are not in P; nor has anyone proved that no such problem exists.

If you can find the answer and prove it, the Clay Mathematics Institute will give you $1 million.

It is presumed to be possible to be in NP but not P and not NP-complete (although it would be impossible if P=NP

so nobody is completely sure).

A presumed example is INTEGER FACTORIZATION.

i won't be able to watch for the era of quantum computing, while we could make NP-finished problems look like new child's play. i've got study that even photosynthesis makes use of a certainly-happening quantum optimization technique.

Puggy They are Talking about you...!!

http://www.osoq.com/funstuff/extra/extra03.asp?str...