youtor.org
The Complexity classes
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=aDIjXWhvKFk
Computational problems can be classified into different complexity classes. • They are • Class P: Those Problem that are solvable in Polynomial time. • Class NP: Those Problem that are “verifiable” in polynomial time by a Deterministic Turing Machine • Class NP Hard: All NP problems can be transformed in polynomial time into it • Class NP COmplete: if it is in NP and NP-hard • • To know whether P=NP watch this video • Is class P= Class NP?
#############################
New on site
