NE (complexity)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.

See also[edit]

References[edit]

  1. ^ Complexity Zoo: NE