This is an old revision of this page, as edited by 24.85.232.10 (talk) at 23:33, 6 March 2017. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
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.
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |
