NTIME

Computer, Computing, Engineering, Mathematics, Natural sciences, Physical sciences, Science, Sciences In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).