This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Complexity of algorithms, Page 3 15.3 Complexity classes P: the class of decision problems having a polynomial time algorithm. NP: the class of decision problems whose positive instance can be veriﬁed in polynomial time. Example of an NP problem: Clique. NPcomplete problems: in NP and hardest in NP. Is P=NP? February 22 Complexity of algorithms, Page 4...
View
Full Document
 Winter '07
 YaoyunShi
 Algorithms, Big O notation, Computational complexity theory

Click to edit the document details