Lesson plan
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 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.
Article summary
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.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.