NE (complexity)

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 . It is similar to NEXPTIME, the set of decision problems that can be solved by a non-deterministic Turing machine in time . By definition, it is contained in NEXPTIME.

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

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.