NE (complexity)

From Wikipedia, the free encyclopedia

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(kⁿ) for some k.

NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.

See also

E (complexity).

References

Complexity Zoo: NE.

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.