In complexity theory, the class NP consists of decision problems whose positive solutions are verifiable by a deterministic Turing machine within polynomial time