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.[1]
NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
See also
E (complexity).
References
Complexity Zoo: NE
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
Hellenica World - Scientific Library
Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License
