NTIME
|
|
In computational complexity theory, the complexity class NTIME(f(n)) is the set of decision problems that can be solved by a non-deterministic Turing machine using time O(f(n)), and unlimited space.
The well-known complexity class NP can be defined in terms of NTIME as follows:
- <math>\mbox{NP} = \bigcup_{k\in\mathbb{N}} \mbox{NTIME}(n^k)<math>