NE (complexity)

From Wikipedia, the free encyclopedia

Jump to navigation Jump to 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(kⁿ) for some k.^[1]

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

Relationship to other classes

[edit | edit source]

Error creating thumbnail: File missing

This section has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (February 2023) (Learn how and when to remove this message)

This section needs expansion. You can help by adding to it. (February 2023)

(Learn how and when to remove this message)

NE is contained by NEXPTIME.

See also

[edit | edit source]

E (complexity)

References

[edit | edit source]

^ Complexity Zoo: NE

P ≟ NP

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "http://70.231.62.181/index.php?title=NE_(complexity)&oldid=1452523"

Hidden categories: