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
HAS PART
PART OF
Wikipedia
Wikidata
EN
NE