Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03512051n
Noun Named Entity
Categories: Complexity classes, Theoretical computer science stubs
EN
NE
EN
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 for some k. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
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 for some k. Wikipedia
A class in computational complexity theory Wikipedia Disambiguation
Class in computational complexity theory Wikidata
IS A
complexity class
HAS PART
E
PART OF
NEXPTIME
Wikipedia
EN
NE (complexity)
Wikidata
EN
NE

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License