In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems. Informally, NP is the set of all decision problems for which the instances where the answer is ''yes'' have efficiently verifiable proofs. More precisely, these proofs have to be verifiable by deterministic computations that can be performed in polynomial time.

Is the following statement correct based on the text

can np problems be solved in polynomial time
yes