NE (complexity)
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(kn) for some k.{{ComplexityZoo|NE|N#ne}}
NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
Relationship to other classes
{{Multiple issues|section=yes|
{{Unreferenced section|date=February 2023}}
{{Expand section|date=February 2023}}
}}
NE is contained by NEXPTIME.