Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
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:
-
Complexity classes
Read more »