bn:03506552n
Noun Named Entity
Categories: Computational resources, Complexity classes
EN
NTIME  non-deterministic time  Nondeterministic time
EN
In computational complexity theory, the complexity class NTIME is the set of decision problems that can be solved by a non-deterministic Turing machine which runs in time O. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, the complexity class NTIME is the set of decision problems that can be solved by a non-deterministic Turing machine which runs in time O. Wikipedia
Wikipedia
EN
Wikidata
EN
Wikipedia Redirections