NE (complexity)
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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 2^{O(n)} . It is similar to NEXPTIME, the set of decision problems that can be solved by a non-deterministic Turing machine in time 2^{n^O(1)} . By definition, it is contained in NEXPTIME. NE, unlike NEXPTIME, is not closed under polynomial-time many-one reductions.
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 2^{O(n)} . It is similar to NEXPTIME, the set of decision problems that can be solved by a non-deterministic Turing machine in time 2^{n^O(1)} . By definition, it is contained in NEXPTIME. NE, unlike NEXPTIME, is not closed under polynomial-time many-one reductions. ==See also== E (complexity) ==References==
Text derived from https://en.wikipedia.org/w/index.php?oldid=1348164773 under CC BY-SA 4.0; modifications have been made.