NE_(complexity)

NE (complexity)

NE (complexity)

Add article description

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.

Relationship to other classes

NE is contained by NEXPTIME.

See also

References

  1. [1]
    Complexity Zoo: NE
P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article NE_(complexity), and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.