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(kn) for some k.
NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
[edit] See also
[edit] References
| P ≟ NP | This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it. |
