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.
NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
See also
References
This article is issued from Wikipedia - version of the Wednesday, March 13, 2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.