1 Answers
In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in time O for some k.
NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
4 views
Answered